1614 search results - page 133 / 323 » Breadth-First Heuristic Search |
140
click to vote
WEBI
2009
Springer
15 years 11 months ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
127
click to vote
EVOW
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
132
click to vote
SAGA
2001
Springer
15 years 9 months ago
2001
Springer
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...
163
click to vote
AAAI
2007
15 years 6 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
156
click to vote
AIPS
2007
15 years 6 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...