Sciweavers

309 search results - page 49 / 62
» Approximation algorithms for dynamic resource allocation
Sort
View
CDC
2008
IEEE
132views Control Systems» more  CDC 2008»
14 years 2 months ago
A distributed auction algorithm for the assignment problem
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
Michael M. Zavlanos, Leonid Spesivtsev, George J. ...
MICRO
1998
IEEE
144views Hardware» more  MICRO 1998»
14 years 4 days ago
Analyzing the Working Set Characteristics of Branch Execution
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
Sangwook P. Kim, Gary S. Tyson
CGF
2008
138views more  CGF 2008»
13 years 8 months ago
Geometry-Aware Framebuffer Level of Detail
This paper introduces a framebuffer level of detail algorithm for controlling the pixel workload in an interactive rendering application. Our basic strategy is to evaluate the sha...
Lei Yang, Pedro V. Sander, Jason Lawrence
DCOSS
2008
Springer
13 years 9 months ago
Frugal Sensor Assignment
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro...
GCC
2004
Springer
14 years 1 months ago
Hybrid Performance-Oriented Scheduling of Moldable Jobs with QoS Demands in Multiclusters and Grids
This paper addresses the dynamic scheduling of moldable jobs with QoS demands (soft-deadlines) in multiclusters. A moldable job can be run on a variable number of resources. Three ...
Ligang He, Stephen A. Jarvis, Daniel P. Spooner, X...