2252 search results - page 102 / 451 » Lower Bounds for Dynamic Algorithms |
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
95
Voted
SODA
2008
ACM
15 years 3 months ago
2008
ACM
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
108
click to vote
ISIPTA
2003
IEEE
15 years 6 months ago
2003
IEEE
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional p...
114
click to vote
CORR
2008
Springer
15 years 1 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...
103
click to vote
AAAI
1997
15 years 2 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...