1480 search results - page 94 / 296 » Ants can solve constraint satisfaction problems |
ICWL
2007
Springer
15 years 3 months ago
2007
Springer
Intelligent Tutoring Systems have made great strides in recent years. Many of these gains have been achieved for welldefined problems. However, solving ill-defined problems is imp...
TRANSCI
2010
14 years 4 months ago
2010
Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duratio...
COMPSAC
2004
IEEE
15 years 1 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
PVLDB
2008
14 years 9 months ago
2008
This paper presents a framework for automatically generating structural XML documents. The user provides a target DTD and an example of an XML document, called a Generate-XML-ByEx...
JAIR
2000
14 years 9 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...