10608 search results - page 692 / 2122 » Complexity of O'Hara's Algorithm |
224
Voted
OPODIS
2007
15 years 8 months ago
2007
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
176
Voted
AAAI
2006
15 years 8 months ago
2006
Automated domain factoring, and planning methods that utilize them, have long been of interest to planning researchers. Recent work in this area yielded new theoretical insight an...
185
Voted
IJCAI
2001
15 years 8 months ago
2001
Combinatorial auctions provide a valuable mechanism for the allocation of goods in settings where buyer valuations exhibit complex structure with respect to substitutabilityand co...
158
click to vote
WSC
2004
15 years 8 months ago
2004
Simulation methods are extensively used in modeling complex scheduling problems. However, traditional layout of simulation models can become complicated when they are used to find...
177
Voted
AIPS
2009
15 years 8 months ago
2009
Distributed POMDPs provide an expressive framework for modeling multiagent collaboration problems, but NEXPComplete complexity hinders their scalability and application in real-wo...