5180 search results - page 908 / 1036 » Concurrency, Time, and Constraints |
178
click to vote
AAAI
2008
15 years 8 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
169
click to vote
AIPS
2007
15 years 8 months ago
2007
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...
155
click to vote
WSC
2007
15 years 8 months ago
2007
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
160
click to vote
USS
2008
15 years 8 months ago
2008
Making vital disk data recoverable even in the event of OS compromises has become a necessity, in view of the increased prevalence of OS vulnerability exploits over the recent yea...
166
click to vote
WSC
2007
15 years 8 months ago
2007
The key question addressed by the resource-constrained project scheduling problem (RCPSP) is to determine the start times for each activity such that precedence and resource const...