346 search results - page 61 / 70 » Logical omniscience as a computational complexity problem |
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
DOLAP
2006
ACM
13 years 11 months ago
2006
ACM
As more and more information is available on the web, it is a problem that many web resources are not accessible, i.e., are not usable for users with special needs. For example, f...
SPAA
2010
ACM
14 years 11 days ago
2010
ACM
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
IWCMC
2009
ACM
14 years 7 days ago
2009
ACM
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...