84 search results - page 1 / 17 » Distributed search in railway scheduling problems |
EAAI
2008
13 years 11 months ago
2008
KBS
2007
13 years 10 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
IAAI
2003
14 years 6 days ago
2003
This paper reports some results of a long-term work in application of AI techniques whose ultimate goal is the development of tools for resource scheduling. Most of the efforts so...
CP
2005
Springer
14 years 4 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
ATAL
2009
Springer
14 years 5 months ago
2009
Springer
This paper describes the design, implementation, visualizations, results and lessons learned of a novel real-world socio-technical research system for the purpose of rescheduling ...