Sciweavers

3875 search results - page 454 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
IJCAI
2003
15 years 8 months ago
Probabilistically Survivable MASs
Muhiagent systems (MAS) can "go down" for a large number of reasons, ranging from system malfunctions and power failures to malicious attacks. The placement of agents on...
Sarit Kraus, V. S. Subrahmanian, N. Cihan Tas
CORR
2010
Springer
204views Education» more  CORR 2010»
15 years 5 months ago
Predictive State Temporal Difference Learning
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...
Byron Boots, Geoffrey J. Gordon
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
16 years 7 months ago
Conditional hardness for satisfiable 3-CSPs
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
Ryan O'Donnell, Yi Wu
258
Voted
PODS
2009
ACM
110views Database» more  PODS 2009»
16 years 7 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
ICDCS
2009
IEEE
16 years 1 months ago
Stochastic Multicast with Network Coding
The usage of network resources by content providers is commonly governed by Service Level Agreements (SLA) between the content provider and the network service provider. Resource ...
Ajay Gopinathan, Zongpeng Li