CORR
2008
Springer
13 years 5 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
CORR
2008
Springer
13 years 5 months ago
2008
Springer
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
CORR
2008
Springer
2008
Springer
Ascending runs in dependent uniformly distributed random variables: Application to wireless networks
13 years 5 months ago
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We study the problem of gambling in horse races with causal side information and show that Massey's directed information characterizes the increment in the maximum achievable ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The capacity region of the Finite-State Multiple Access Channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered....
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract-- Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
