Sciweavers

14 search results - page 2 / 3
» A Hybrid Linear Programming and Relaxed Plan Heuristic for P...
Sort
View
AAI
2005
117views more  AAI 2005»
13 years 5 months ago
Machine Learning in Hybrid Hierarchical and Partial-Order Planners for Manufacturing Domains
The application of AI planning techniques to manufacturing systems is being widely deployed for all the tasks involved in the process, from product design to production planning an...
Susana Fernández, Ricardo Aler, Daniel Borr...
ASE
1998
81views more  ASE 1998»
13 years 5 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
ICTAI
2002
IEEE
13 years 10 months ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali
CP
2005
Springer
13 years 11 months ago
Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
CP
2007
Springer
13 years 11 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...