Sciweavers

693 search results - page 37 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
SIGSOFT
2007
ACM
16 years 4 months ago
The impact of input domain reduction on search-based test data generation
There has recently been a great deal of interest in search? based test data generation, with many local and global search algorithms being proposed. However, to date, there has be...
Mark Harman, Youssef Hassoun, Kiran Lakhotia, Phil...
119
Voted
ICPR
2006
IEEE
16 years 4 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
CIKM
2005
Springer
15 years 9 months ago
Static score bucketing in inverted indexes
Maintaining strict static score order of inverted lists is a heuristic used by search engines to improve the quality of query results when the entire inverted lists cannot be proc...
Chavdar Botev, Nadav Eiron, Marcus Fontoura, Ning ...
CAEPIA
2007
Springer
15 years 7 months ago
Efficient Pruning of Operators in Planning Domains
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
Anders Jonsson
EOR
2008
200views more  EOR 2008»
15 years 3 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...