42 search results - page 6 / 9 » Programmed Search in a Timetabling Problem over Finite Domai... |
FLAIRS
2007
13 years 9 months ago
2007
In this work we explore how the complexity of a problem domain affects the performance of evolutionary search using a performance-based restart policy. Previous research indicates...
CP
2008
Springer
13 years 8 months ago
2008
Springer
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
AAAI
2010
13 years 8 months ago
2010
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
AAAI
1990
13 years 8 months ago
1990
Programs such as Bacon, Abacus, Coper, Kepler and others are designed to find functional relationships of scientific significance in numerical data without relying on the deep dom...
ICML
2000
IEEE
14 years 8 months ago
2000
IEEE
Machine learning research has been very successful at producing powerful, broadlyapplicable classification learners. However, many practical learning problems do not fit the class...