102291 search results - page 19671 / 20459 » Computing |
188
click to vote
SIGECOM
2005
ACM
16 years 22 days ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
196
click to vote
SIGECOM
2005
ACM
16 years 22 days ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
238
click to vote
SIGECOM
2005
ACM
16 years 22 days ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
190
click to vote
SIGECOM
2005
ACM
16 years 22 days ago
2005
ACM
In a previously reported user study, we found that users were able to perform decision tradeoff tasks more efficiently and commit considerably fewer errors with the example critiq...
202
click to vote
SIGIR
2005
ACM
16 years 22 days ago
2005
ACM
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...