Sciweavers

1095 search results - page 212 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
AAAI
2010
14 years 11 months ago
Stackelberg Voting Games: Computational Aspects and Paradoxes
We consider settings in which voters vote in sequence, each voter knows the votes of the earlier voters and the preferences of the later voters, and voters are strategic. This can...
Lirong Xia, Vincent Conitzer
96
Voted
CASES
2010
ACM
14 years 7 months ago
Improved procedure placement for set associative caches
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
Yun Liang, Tulika Mitra
CLUSTER
2007
IEEE
15 years 4 months ago
Balancing productivity and performance on the cell broadband engine
— The Cell Broadband Engine (BE) is a heterogeneous multicore processor, combining a general-purpose POWER architecture core with eight independent single-instructionmultiple-dat...
Sadaf R. Alam, Jeremy S. Meredith, Jeffrey S. Vett...
POPL
2005
ACM
15 years 10 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
PODS
2008
ACM
128views Database» more  PODS 2008»
15 years 9 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren