120 search results - page 12 / 24 » Searching for close alternative plans |
106
Voted
MICAI
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
SIGMOD
2003
ACM
15 years 12 months ago
2003
ACM
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
107
Voted
IVC
2007
14 years 11 months ago
2007
A unified evolutionary approach to coplanar radiotherapy inverse planning is proposed. It consists of a genetic algorithm-based framework that solves with little modification tr...
100
click to vote
AAAI
2004
15 years 1 months ago
2004
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...