In order to apply texture measurement based heuristic commitment techniques beyond the unary capacity resource constraints of job shop scheduling, we extend the contention texture...
J. Christopher Beck, Andrew J. Davenport, Edward M...
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
Markov Decision Processes (MDPs), currently a popular method for modeling and solving decision theoretic planning problems, are limited by the Markovian assumption: rewards and dy...
The degree to which a planner succeeds and meets response deadlines depends on the correctness and completenessof its modelswhichdescribe events and actions that change the world ...
Mixed-initiative planning is one approach to building an intelligent decision-making environment. A mixedinitiative system shares decision-making responsibility with the user such...
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...