Sciweavers

808 search results - page 107 / 162
» A scaling algorithm for polynomial constraint satisfaction p...
Sort
View
CCE
2004
14 years 9 months ago
Tabu search algorithm for chemical process optimization
: This paper presents a meta-heuristic optimization algorithm, Tabu Search (TS), and describes how it can be used to solve a wide variety of chemical engineering problems. Modifica...
B. Lin, D. C. Miller
CP
2006
Springer
15 years 1 months ago
Mini-bucket Elimination with Bucket Propagation
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
Emma Rollon, Javier Larrosa
ANOR
2004
116views more  ANOR 2004»
14 years 9 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
TMI
2010
298views more  TMI 2010»
14 years 4 months ago
An Efficient Numerical Method for General Lp Regularization in Fluorescence Molecular Tomography
Abstract--Reconstruction algorithms for fluorescence tomography have to address two crucial issues : (i) the ill-posedness of the reconstruction problem, (ii) the large scale of nu...
Jean-Charles Baritaux, Kai Hassler, Michael Unser
IVC
2007
131views more  IVC 2007»
14 years 9 months ago
Multi-view correspondence by enforcement of rigidity constraints
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...
Ricardo Oliveira, João Xavier, João ...