976 search results - page 89 / 196 » The Complexity of Timetable Construction Problems |
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
CISSE
2008
Springer
13 years 10 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
AI
1999
Springer
13 years 8 months ago
1999
Springer
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
EH
1999
IEEE
14 years 1 months ago
1999
IEEE
We address the fundamental issue of fully automated design (FAD) and construction of inexpensive robots and their controllers. Rather than seek an intelligent general purpose robo...