1197 search results - page 11 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
143
Voted
JAIR
2010
15 years 4 months ago
2010
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
156
click to vote
CONSTRAINTS
2011
15 years 18 days ago
2011
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
198
click to vote
AAAI
2008
15 years 8 months ago
2008
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
147
click to vote
AIMSA
2008
Springer
15 years 12 months ago
2008
Springer
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
204
click to vote
PACT
1999
Springer
15 years 9 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...