Sciweavers

98 search results - page 17 / 20
» Macro-op Scheduling: Relaxing Scheduling Loop Constraints
Sort
View
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
13 years 11 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
RTAS
1995
IEEE
13 years 11 months ago
Design and evaluation of a window-consistent replication service
—Real-time applications typically operate under strict timing and dependability constraints. Although traditional data replication protocols provide fault tolerance, real-time gu...
Ashish Mehra, Jennifer Rexford, Hock-Siong Ang, Fa...
AAAI
2008
13 years 10 months ago
Planning with Problems Requiring Temporal Coordination
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heu...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
AIPS
2000
13 years 9 months 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
IJMI
2002
126views more  IJMI 2002»
13 years 7 months ago
Representation primitives, process models and patient data in computer-interpretable clinical practice guidelines: : A literatur
Representation of clinical practice guidelines in a computer-interpretable format is a critical issue for guideline development, implementation, and evaluation. We studied 11 type...
Dongwen Wang, Mor Peleg, Samson W. Tu, Aziz A. Box...