Sciweavers

591 search results - page 77 / 119
» A constraint programming approach to cutset problems
Sort
View
JSAT
2006
134views more  JSAT 2006»
14 years 9 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah
AUTOMATICA
2005
115views more  AUTOMATICA 2005»
14 years 9 months ago
Robust constrained predictive control using comparison model
This paper proposes a quadratic programming (QP) approach to robust model predictive control (MPC) for constrained linear systems having both model uncertainties and bounded distu...
Hiroaki Fukushima, Robert R. Bitmead
PERCOM
2007
ACM
15 years 9 months ago
Ontology-Directed Generation of Frameworks for Pervasive Service Development
Pervasive computing applications are tedious to develop because they combine a number of problems ranging from device heterogeneity, to middleware constraints, to lack of programm...
Charles Consel, Wilfried Jouve, Julien Lancia, Nic...
EOR
2008
75views more  EOR 2008»
14 years 10 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
ECCV
2002
Springer
15 years 11 months ago
Minimal Surfaces for Stereo
Abstract. Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorith...
Chris Buehler, Steven J. Gortler, Michael F. Cohen...