Sciweavers

388 search results - page 26 / 78
» Improving Exact Algorithms for MAX-2-SAT
Sort
View
ATAL
2011
Springer
12 years 8 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
AAAI
2006
13 years 10 months ago
An Edge Deletion Semantics for Belief Propagation and its Practical Impact on Approximation Quality
We show in this paper that the influential algorithm of iterative belief propagation can be understood in terms of exact inference on a polytree, which results from deleting enoug...
Arthur Choi, Adnan Darwiche
IWPEC
2010
Springer
13 years 6 months ago
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
Jesper Nederlof, Johan M. M. van Rooij
CORR
2011
Springer
206views Education» more  CORR 2011»
13 years 3 months ago
Arrangement Computation for Planar Algebraic Curves
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
Eric Berberich, Pavel Emeliyanenko, Alexander Kobe...
ICIP
2009
IEEE
14 years 9 months ago
Modified Compressive Sensing For Real-time Dynamic Mr Imaging
In this work, we propose algorithms to recursively and causally reconstruct a sequence of natural images from a reduced number of linear projection measurements taken in a domain ...