157 search results - page 19 / 32 » Totality in arena games |
GLOBECOM
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper we provide a mathematical ILP model for the Regeneration Placement Problem (RPP) which minimizes the total number of regeneration nodes allocated in a translucent opt...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
PLDI
2012
ACM
11 years 10 months ago
2012
ACM
Software-based thread-level parallelization has been widely studied for exploiting data parallelism in purely computational loops to improve program performance on multiprocessors...
ICALP
2010
Springer
14 years 8 days ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
GECCO
2003
Springer
14 years 21 days ago
2003
Springer
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...