Sciweavers

810 search results - page 8 / 162
» Solving Time-Dependent Planning Problems
Sort
View
145
Voted
SOICT
2010
14 years 6 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
ICMLA
2007
15 years 1 months ago
Learning complex problem solving expertise from failures
Our research addresses the issue of developing knowledge-based agents that capture and use the problem solving knowledge of subject matter experts from diverse application domains...
Cristina Boicu, Gheorghe Tecuci, Mihai Boicu
AAAI
2012
13 years 2 months ago
Real-Time Collaborative Planning with the Crowd
Planning is vital to a wide range of domains, including robotics, military strategy, logistics, itinerary generation and more, that both humans and computers find difficult. Col...
Walter S. Lasecki, Jeffrey P. Bigham, James F. All...
AAAI
2000
15 years 1 months ago
Solving a Supply Chain Optimization Problem Collaboratively
We propose a novel algorithmic framework to solve an integrated planning and scheduling problem in supply chain management. This problem involves the integration of an inventory m...
Hoong Chuin Lau, Andrew Lim, Qi Zhang Liu
AIPS
2011
14 years 3 months ago
Directed Search for Generalized Plans Using Classical Planners
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...