1599 search results - page 113 / 320 » Algorithms for Parity Games |
131
click to vote
EH
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper describes a technique for evolving similar solutions to similar configuration design problems. Using the configuration design of combination logic circuits as a testb...
200
click to vote
FTCS
1993
15 years 7 months ago
1993
This paper describes and evaluates two algorithms for performing on-line failure recovery (data reconstruction) in redundant disk arrays. It presents an implementation of disk-ori...
164
click to vote
COCO
2005
Springer
16 years 1 days ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
169
click to vote
SIGECOM
2003
ACM
15 years 11 months ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
160
click to vote
CIAC
2010
Springer
16 years 3 months ago
2010
Springer
The problem of sharing the cost of a common infrastructure among a set of strategic and cooperating players has been the subject of intensive research in recent years. However, mos...