Sciweavers

663 search results - page 27 / 133
» On the Foundations of Expected Expected Utility
Sort
View
106
Voted
TALG
2008
131views more  TALG 2008»
14 years 9 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
JSAC
2008
102views more  JSAC 2008»
14 years 9 months ago
Inefficient Noncooperation in Networking Games of Common-Pool Resources
We study in this paper a noncooperative approach for sharing resources of a common pool among users, wherein each user strives to maximize its own utility. The optimality notion is...
Hisao Kameda, Eitan Altman
104
Voted
SIGSOFT
2006
ACM
15 years 10 months ago
Failure proximity: a fault localization-based approach
Recent software systems usually feature an automated failure reporting system, with which a huge number of failing traces are collected every day. In order to prioritize fault dia...
Chao Liu 0001, Jiawei Han
72
Voted
CLUSTER
2005
IEEE
15 years 3 months ago
Minimizing the Network Overhead of Checkpointing in Cycle-harvesting Cluster Environments
Cycle-harvesting systems such as Condor have been developed to make desktop machines in a local area (which are often similar to clusters in hardware configuration) available as ...
Daniel Nurmi, John Brevik, Richard Wolski
CF
2004
ACM
15 years 2 months ago
Combining compiler and runtime IPC predictions to reduce energy in next generation architectures
Next generation architectures will require innovative solutions to reduce energy consumption. One of the trends we expect is more extensive utilization of compiler information dir...
Saurabh Chheda, Osman S. Unsal, Israel Koren, C. M...