203 search results - page 2 / 41 » On the Average Complexity of Moore's State Minimization Algo... |
IJCAI
2001
13 years 6 months ago
2001
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
MASCOTS
2001
13 years 6 months ago
2001
We introduce a routing mechanism, referred to as algorithmic routing. It is a viable routing alternative for network simulations with minimal space complexity
STOC
1989
ACM
13 years 9 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
AUTOMATICA
2011
13 years 10 days ago
2011
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...