2108 search results - page 68 / 422 » Constrained Heuristic Search |
159
click to vote
ADC
2009
Springer
16 years 17 days ago
2009
Springer
Given a large volume of Web documents, we consider problem of finding the shortest keyword sequences for each of the documents such that a keyword sequence can be rendered to a g...
140
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
153
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
144
click to vote
ICGI
2004
Springer
15 years 11 months ago
2004
Springer
State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, ...
154
click to vote
IJAIT
2002
15 years 5 months ago
2002
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...