Sciweavers

10890 search results - page 1849 / 2178
» Automatic Complexity Analysis
Sort
View
SC
2003
ACM
15 years 12 months ago
Job Superscheduler Architecture and Performance in Computational Grid Environments
Computational grids hold great promise in utilizing geographically separated heterogeneous resources to solve large-scale complex scientific problems. However, a number of major ...
Hongzhang Shan, Leonid Oliker, Rupak Biswas
SIGECOM
2003
ACM
134views ECommerce» more  SIGECOM 2003»
15 years 12 months ago
Correlated equilibria in graphical games
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
Sham Kakade, Michael J. Kearns, John Langford, Lui...
SIGECOM
2003
ACM
154views ECommerce» more  SIGECOM 2003»
15 years 12 months ago
Exploring bidding strategies for market-based scheduling
A market-based scheduling mechanism allocates resources indexed by time to alternative uses based on the bids of participating agents. Agents are typically interested in multiple ...
Michael P. Wellman, Jeffrey K. MacKie-Mason, Danie...
SIGECOM
2003
ACM
110views ECommerce» more  SIGECOM 2003»
15 years 12 months ago
Virtual worlds: fast and strategyproof auctions for dynamic resource allocation
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
Chaki Ng, David C. Parkes, Margo I. Seltzer
WSNA
2003
ACM
15 years 12 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng
« Prev « First page 1849 / 2178 Last » Next »