210 search results - page 6 / 42 » Some Competition Programming Problems as the Beginning of Ar... |
ECAI
2006
Springer
14 years 11 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
CEC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for prod...
AMAI
2006
Springer
14 years 9 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
CP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
64
Voted
CP
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the bes...