49 search results - page 7 / 10 » Basics of Game Theory for Bioinformatics |
SIGCOMM
1994
ACM
15 years 1 months ago
1994
ACM
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and sel sh, and (2) central admini...
SIGECOM
2005
ACM
15 years 3 months 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 ...
SOFSEM
2010
Springer
15 years 6 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
CONTEXT
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. This paper is devoted to discuss a general tendency in contextualism which is known as "radical contextualism". In the first part I state the well known paradox...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...