2107 search results - page 136 / 422 » Computing Small Search Numbers in Linear Time |
136
Voted
JMLR
2008
15 years 3 months ago
2008
A number of today's state-of-the-art planners are based on forward state-space search. The impressive performance can be attributed to progress in computing domain independen...
127
click to vote
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
185
Voted
FOGA
2011
14 years 7 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
201
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
140
Voted
CCS
2007
ACM
15 years 9 months ago
2007
ACM
Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and...