Unverified50% confidenceBenchmarkExact time
In another set of tests with matching inputs, under the constraint that output latency exceeding 100 milliseconds yields zero utility, the full FPTR pipeline outperforms six independent search baselines (ALNS, tabu search, genetic algorithm, simulated annealing, iterated local search, and GRASP) by 6.68% to 8.35%.
1
Sources
50%
Confidence
Medium-term (~90 days)
Relevance
11/5/2026
First Seen
Valid until: 2/3/2027
Sources
Related Entities
Related Claims
UnverifiedOn the UCR time series classification datasets, the sequential combination of SEED-MAX and F-Test can achieve a pruning rate of about 92% (only 8% of the original random features are retained), while the drop in classification accuracy is almost negligible.68% similarUnverifiedAccording to official performance tests, a search on a graph with 118,000 nodes saw response time drop from 24 milliseconds to 0.004 milliseconds, a speedup of approximately 6,000 times.66% similarUnverifiedUnder the most permissive setting of each relaxed verification rule, relaxed verification accepted an average of 1.34 times as many tokens per round as lossless verification, but the generated completion length inflated to 1.54 times.66% similarUnverifiedOn a test subset of 152 completely untouched questions, anchored hybrid retrieval achieved 42.11%, while the planner-guided method reached only 36.84%.65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1137795API
curl https://kongchang.com/api/v1/knowledge/claims/1137795MCP
get_claim(id=1137795)