Sciweavers

1132 search results - page 65 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
AAAI
2010
15 years 1 months ago
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
Emma Rollon, Rina Dechter
ANOR
2008
171views more  ANOR 2008»
14 years 12 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
STOC
1992
ACM
110views Algorithms» more  STOC 1992»
15 years 3 months ago
Linear Decision Trees: Volume Estimates and Topological Bounds
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
Anders Björner, László Lov&aacu...
ANTS
2006
Springer
94views Algorithms» more  ANTS 2006»
15 years 3 months ago
Fast Bounds on the Distribution of Smooth Numbers
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
Scott T. Parsell, Jonathan Sorenson
UAI
2003
15 years 1 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin