350 search results - page 43 / 70 » Lower and upper bounds on obtaining history independence |
IJCAI
2007
15 years 1 months ago
2007
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
ALGORITHMICA
2010
14 years 12 months ago
2010
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
RTSS
2005
IEEE
15 years 5 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
108
click to vote
INFOCOM
2010
IEEE
14 years 10 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...
100
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The transmission capacity of an ad-hoc network is the maximum density of active transmitters in an unit area, given an outage constraint at each receiver for a fixed rate of transm...