1603 search results - page 177 / 321 » Multi-Dimensional Heuristic Searching |
140
click to vote
EVOW
2010
Springer
15 years 8 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
127
click to vote
AAAI
2007
15 years 6 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
132
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Pattern Databases were a major breakthrough in heuristic search by solving hard combinatorial problems various orders of magnitude faster than state-of-the-art techniques at that ...
122
click to vote
IJCAI
2001
15 years 5 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
189
click to vote
ASE
1998
15 years 4 months ago
1998
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...