Sciweavers

7006 search results - page 579 / 1402
» Approximation Algorithms
Sort
View
ECAI
2008
Springer
15 years 8 months ago
Exploiting locality of interactions using a policy-gradient approach in multiagent learning
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...
Francisco S. Melo
APPROX
2007
Springer
102views Algorithms» more  APPROX 2007»
16 years 1 months ago
Hardness of Embedding Metric Spaces of Equal Size
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
Subhash Khot, Rishi Saket
UAI
1996
15 years 8 months ago
Efficient Search-Based Inference for noisy-OR Belief Networks: TopEpsilon
Inference algorithms for arbitrary belief networks are impractical for large, complex belief networks. Inference algorithms for specialized classes of belief networks have been sh...
Kurt Huang, Max Henrion
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
ORL
1998
137views more  ORL 1998»
15 years 6 months ago
Calculation of stability radii for combinatorial optimization problems
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
Nilotpal Chakravarti, Albert P. M. Wagelmans