2108 search results - page 234 / 422 » Constrained Heuristic Search |
171
click to vote
CIKM
1999
Springer
15 years 10 months ago
1999
Springer
We present the architecture and a performance assessment of an extensible query optimizer written in Venus. Venus is a general-purpose active-database rule language embedded in C+...
229
click to vote
ADBIS
2007
Springer
15 years 10 months 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 ...
163
click to vote
EVOW
2010
Springer
15 years 10 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...
154
click to vote
AAAI
2007
15 years 8 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...
166
click to vote
ECAI
2008
Springer
15 years 8 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 ...