1080 search results - page 55 / 216 » The Complexity of Belief Update |
148
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...
179
click to vote
INFOCOM
1995
IEEE
15 years 9 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
174
click to vote
ROBOCUP
2007
Springer
16 years 12 days ago
2007
Springer
Reinforcement learning is a paradigm under which an agent seeks to improve its policy by making learning updates based on the experiences it gathers through interaction with the en...
153
click to vote
UC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
197
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...