515 search results - page 83 / 103 » Approximating Markov Processes by Averaging |
111
Voted
JSAC
2006
14 years 11 months ago
2006
Abstract--In this paper, we consider a many-to-one sensor network where a large number of sensors are deployed to monitor a physical environment. We explore sensor activity managem...
129
click to vote
ECUMN
2004
Springer
15 years 3 months ago
2004
Springer
Traffic engineering of IP networks requires the characterization and modeling of network traffic on multiple time scales due to the existence of several statistical properties that...
ISPD
1999
ACM
15 years 4 months ago
1999
ACM
We study alternatives to FM-based partitioning in the context of end-case processing for top-down standard-cell placement. The primary motivation is that small partitioning instan...
NECO
2007
14 years 11 months ago
2007
Learning agents, whether natural or artificial, must update their internal parameters in order to improve their behavior over time. In reinforcement learning, this plasticity is ...
118
click to vote
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...