6095 search results - page 372 / 1219 » Learning in Local Search |
220
click to vote
TEC
2002
15 years 6 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
187
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— Our goal in this work is to make high level decisions for mobile robots. In particular, given a queue of prioritized object delivery tasks, we wish to find a sequence of actio...
166
click to vote
AI
1998
Springer
15 years 11 months ago
1998
Springer
During past few years, a variety of methods have been developed for learning probabilistic networks from data, among which the heuristic single link forward or backward searches ar...
170
click to vote
AIEDAM
1998
15 years 6 months ago
1998
Gradient-based numerical optimization of complex engineering designs offers the promise of rapidly producing better designs. However, such methods generally assume that the object...
209
click to vote
ILP
2004
Springer
16 years 4 days ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...