Sciweavers

4430 search results - page 53 / 886
» Solving Optimization Problems with DLL
Sort
View
AIIA
2011
Springer
13 years 11 months ago
Over-Subscription Planning with Boolean Optimization: An Assessment of State-of-the-Art Solutions
Abstract. In this work we present an assessment of state-of-the-art Boolean optimization solvers from different AI communities on over-subscription planning problems. The goal of t...
Marco Maratea, Luca Pulina
CORR
2008
Springer
150views Education» more  CORR 2008»
14 years 12 months ago
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
Mugurel Ionut Andreica
AUTOMATICA
2004
128views more  AUTOMATICA 2004»
14 years 11 months ago
A convex optimization approach to the mode acceleration problem
The purpose of this note is to introduce an alternative procedure to the mode acceleration method when the underlying structure model includes damping. We will show that the probl...
S. O. Reza Moheimani, Dunant Halim
ICASSP
2007
IEEE
15 years 6 months ago
Multiple View Region Matching as a Lagrangian Optimization Problem
A method to establish correspondences between regions belonging to independent segmentations of multiple views of a scene is presented. The trade-off between color similarity and ...
Felipe Calderero, Ferran Marqués, Antonio O...
MOC
2002
101views more  MOC 2002»
14 years 11 months ago
Global and uniform convergence of subspace correction methods for some convex optimization problems
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained con...
Xue-Cheng Tai, Jinchao Xu