94 search results - page 14 / 19 » Approximating covering problems by randomized search heurist... |
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
ATAL
2009
Springer
13 years 9 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
DAM
2010
13 years 8 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
CEC
2010
IEEE
12 years 11 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...