2343 search results - page 48 / 469 » Visual-Concept Search Solved |
112
Voted
SSIAI
2002
IEEE
15 years 6 months ago
2002
IEEE
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
120
Voted
KR
2004
Springer
15 years 6 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
78
Voted
DSS
2007
15 years 1 months ago
2007
Abstract. In this paper, the optimization of the Berth Allocation Problem (BAP) is transformed into a multiple stage decision making procedure and a new stochastic beam search algo...
110
Voted
HEURISTICS
2002
15 years 26 days ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
111
Voted
AIPS
2011
14 years 4 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...