228 search results - page 21 / 46 » Expected Reachability-Time Games |
131
Voted
CIAC
2010
Springer
15 years 5 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
132
click to vote
JSAC
2008
15 years 1 months ago
2008
If a network is to operate successfully, its users need to collaborate. Collaboration takes the form of following a network protocol and involves some resource expenditure on the p...
134
Voted
SIGMETRICS
2002
ACM
15 years 1 months ago
2002
ACM
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
106
Voted
VTC
2010
IEEE
15 years 7 days ago
2010
IEEE
— In this paper, we look into the channel allocation problem for a non-cooperative cognitive vehicular ad-hoc communication network with multiple communicating pairs distributed ...
118
Voted
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
—We consider the situation where N nodes share a common access point. With each node i there is an associated buffer and channel state that change in time. Node i dynamically cho...