728 search results - page 57 / 146 » Efficient Searching with Linear Constraints |
137
click to vote
AIPS
2000
15 years 7 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
180
click to vote
HEURISTICS
2008
15 years 4 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
177
click to vote
AAAI
2006
15 years 7 months ago
2006
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
187
click to vote
PRL
2008
15 years 5 months ago
2008
The traditional closest point criterion has been widely used for 3D free form shape matching, object recognition, internet search, computer graphics and medical imaging. However, ...
165
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
The recovery of writing trajectory from offline handwritten image is generally regarded as a difficult problem [1]. This paper introduced a method to recover the writing trajector...