1639 search results - page 182 / 328 » Anytime Heuristic Search |
ADBIS
2007
Springer
14 years 29 days ago
2007
Springer
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
EVOW
2010
Springer
14 years 29 days 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...
AAAI
2007
13 years 11 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...
ECAI
2008
Springer
13 years 10 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 ...
IJCAI
2001
13 years 10 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...