We present a Riemann solver derived by a relaxation technique for classical single-phase shallow flow equations and for a two-phase shallow flow model describing a mixture of so...
Given an arbitrary constraint c on n variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation th...
Ian P. Gent, Christopher Jefferson, Ian Miguel, Pe...
This paper attempts to analyze the issue of planning and scheduling integration from the point of view of information sharing. This concept is the basic bridging factor between the...
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...
Julie A. Shah, John Stedl, Brian C. Williams, Paul...