79 search results - page 13 / 16 » A Dynamic Programming Framework for Combinatorial Optimizati... |
IJCAI
1997
13 years 9 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
ICRA
1998
IEEE
14 years 2 hour ago
1998
IEEE
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
AIPS
2007
13 years 10 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....