784 search results - page 71 / 157 » Histogram-based search: A comparative study |
137
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
115
click to vote
AIPS
2007
15 years 6 months ago
2007
We present an any-time concurrent probabilistic temporal planner that includes continuous and discrete uncertainties and metric functions. Our approach is a direct policy search t...
120
Voted
AAAI
2000
15 years 5 months ago
2000
Both the Artificial Intelligence (AI) community and the Operations Research (OR) community are interested in developing techniques for solving hard combinatorial problems. OR has ...
117
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
We describe the application of genetic programming (GP) to a problem in pure mathematics, in the study of finite algebras. We document the production of human-competitive results...
150
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and...