Sciweavers

502 search results - page 29 / 101
» Monotone Approximation of Decision Problems
Sort
View
SEFM
2006
IEEE
15 years 3 months ago
A Theory of Singly-Linked Lists and its Extensible Decision Procedure
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
Silvio Ranise, Calogero G. Zarba
AIPS
2008
14 years 12 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
73
Voted
CRYPTO
2009
Springer
154views Cryptology» more  CRYPTO 2009»
15 years 4 months ago
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
Vadim Lyubashevsky, Daniele Micciancio
76
Voted
TSP
2008
150views more  TSP 2008»
14 years 9 months ago
Local Vote Decision Fusion for Target Detection in Wireless Sensor Networks
This study examines the problem of target detection by a wireless sensor network. Sensors acquire measurements emitted from the target that are corrupted by noise and initially ma...
Natallia Katenka, Elizaveta Levina, George Michail...
100
Voted
FOCS
2007
IEEE
15 years 4 months ago
Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
Sudipto Guha, Kamesh Munagala