Sciweavers

2024 search results - page 79 / 405
» Improving quality, one process change at a time
Sort
View
SIGMOD
2002
ACM
137views Database» more  SIGMOD 2002»
14 years 9 months ago
Partial results for online query processing
Traditional query processors generate full, accurate query results, either in batch or in pipelined fashion. We argue that this strict model is too rigid for exploratory queries o...
Vijayshankar Raman, Joseph M. Hellerstein
PPL
2010
117views more  PPL 2010»
14 years 4 months ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
ICALP
2009
Springer
15 years 4 months ago
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy ...
AAAI
2006
14 years 11 months ago
An Iterative Algorithm for Solving Constrained Decentralized Markov Decision Processes
Despite the significant progress to extend Markov Decision Processes (MDP) to cooperative multi-agent systems, developing approaches that can deal with realistic problems remains ...
Aurélie Beynier, Abdel-Illah Mouaddib
SIGMETRICS
2012
ACM
251views Hardware» more  SIGMETRICS 2012»
13 years 9 days ago
Providing fairness on shared-memory multiprocessors via process scheduling
Competition for shared memory resources on multiprocessors is the most dominant cause for slowing down applications and makes their performance varies unpredictably. It exacerbate...
Di Xu, Chenggang Wu, Pen-Chung Yew, Jianjun Li, Zh...