481 search results - page 15 / 97 » Martin's game: a lower bound for the number of sets |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
FCT
2005
Springer
14 years 2 months ago
2005
Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
CIKM
2005
Springer
14 years 2 months ago
2005
Springer
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
CAAN
2007
Springer
14 years 17 days ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service disciplin...