Sciweavers

674 search results - page 52 / 135
» Resource Bound Certification
Sort
View
AIPS
2004
15 years 1 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola
AGENTS
2000
Springer
15 years 4 months ago
Design-to-Criteria Scheduling: Real-Time Agent Control
Design-to-Criteria builds custom schedules for agents that meet hard temporal constraints, hard resource constraints, and soft constraints stemming from soft task interactions or ...
Thomas Wagner, Victor R. Lesser
MICRO
1999
IEEE
110views Hardware» more  MICRO 1999»
15 years 4 months ago
Balance Scheduling: Weighting Branch Tradeoffs in Superblocks
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
Alexandre E. Eichenberger, Waleed Meleis
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
15 years 6 months ago
On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design
In this paper we study a large class of resource allocation problems with an important complication, the utilization cost of a given resource is private information of a profit ma...
José R. Correa, Nicolas Figueroa
ESOP
2009
Springer
15 years 6 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell