Resolving Uncontrollable Conditional Temporal Problems using Continuous Relaxations Peng Yu and Cheng Fang and Brian Williams Massachusetts Institute of Technology Computer Science and Articial Intel
edu Abstract Uncertainty is commonly encountered in temporal scheduling and planning problems and can often lead to overconstrained situations Previous relaxation al gorithms for overconstrained temporal problems only work with requirement constraint
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "Resolving Uncontrollable Conditional Tem..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.