1589 search results - page 177 / 318 » Multiple-Goal Heuristic Search |
161
click to vote
IEAAIE
2001
Springer
15 years 11 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
174
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+...
232
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 ...
164
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...
155
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...