511 search results - page 43 / 103 » Lower bounds for distributed markov chain problems |
CDC
2009
IEEE
14 years 19 days ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
SC
1994
ACM
13 years 12 months ago
1994
ACM
The N - body problem is to simulate the motion of N particles under the influence of mutual force fields based on an inverse square law. Greengard's algorithm claims to compu...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...
QEST
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...