Sciweavers

103 search results - page 12 / 21
» Hedonic clustering games
Sort
View
EWCBR
2008
Springer
13 years 10 months ago
Discovering Feature Weights for Feature-based Indexing of Q-tables
In this paper we propose an approach to address the old problem of identifying the feature conditions under which a gaming strategy can be effective. For doing this, we will build ...
Chad Hogg, Stephen Lee-Urban, Bryan Auslander, H&e...
CBMS
2009
IEEE
14 years 3 months ago
Lessons learned in developing a low-cost high performance medical imaging cluster
This paper explores the usefulness of the Sony PlayStation 3 R (PS3) for medical image processing. Medical image processing often entails dealing with a large number of high resol...
Kirt D. Lillywhite, Dah-Jye Lee, Sameer Antani, Do...
SIGECOM
2005
ACM
166views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
A price-anticipating resource allocation mechanism for distributed shared clusters
In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed marketbased resource allocation system. Multiple users decide ...
Michal Feldman, Kevin Lai, Li Zhang
CAP
2010
13 years 3 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
SIGCOMM
2009
ACM
14 years 3 months ago
Matchmaking for online games and other latency-sensitive P2P systems
– The latency between machines on the Internet can dramatically affect users’ experience for many distributed applications. Particularly, in multiplayer online games, players s...
Sharad Agarwal, Jacob R. Lorch