Sciweavers

238 search results - page 29 / 48
» Planning as Satisfiability
Sort
View
AAAI
1997
14 years 8 days ago
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
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...
Roberto J. Bayardo Jr., Robert Schrag
HOLOMAS
2011
Springer
12 years 10 months ago
Dynamic Trajectory Replanning for Unmanned Aircrafts Supporting Tactical Missions in Urban Environments
In the last decade we witnessed an increased demand for employment of unmanned aerial vehicles (UAV) in practise. For instance, there is a growing need to provide surveillance task...
Lukás Chrpa, Peter Novák
PUK
2000
14 years 8 days ago
Towards agent-based multi-site scheduling
Scheduling problems are usually treated within single plant environments or within companies with several production locations. Due to the globalization of markets companies can no...
Jürgen Sauer, Tammo Freese, Thorsten Teschke
AIPS
2000
14 years 8 days ago
Mixed-Initiative Resource Management: The AMC Barrel Allocator
In this paper, we describe the Barrel Allocator, a scheduling tool developed for day-to-day allocation and management of airlift and tanker resources at the USAF Air Mobility Comm...
Marcel A. Becker, Stephen F. Smith
TIME
2009
IEEE
14 years 5 months ago
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
Luke Hunsberger