Sciweavers

2136 search results - page 43 / 428
» Improving on Expectation Propagation
Sort
View
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 7 months ago
Reformulation of Global Constraints in Answer Set Programming
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
Christian Drescher, Toby Walsh
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
13 years 10 months ago
Faster Construction of Planar Two-Centers
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
David Eppstein
SAC
2008
ACM
13 years 8 months ago
Improving denial of service resistance using dynamic local adaptations
We improve the resistance of gossip-based multicast to (Distributed) Denial of Service (DoS) attacks using dynamic local adaptations at each node. Each node estimates the current ...
Gal Badishi, Idit Keidar
ICASSP
2008
IEEE
14 years 3 months ago
Mode sign estimation to improve source depth estimation
This paper describes source depth estimation in shallow water environments using a Horizontal Line Array of hydrophones on the sea bottom. A method based on modal propagation, usi...
Barbara Nicolas, Grégoire Le Touzé, ...
ATAL
2007
Springer
14 years 2 months ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe