Sciweavers

551 search results - page 38 / 111
» Continuous Search in Constraint Programming
Sort
View
JAIR
2011
123views more  JAIR 2011»
13 years 3 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
CP
2000
Springer
14 years 1 months ago
Practical Investigation of Constraints with Graph Views
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the proble...
Tobias Müller
AI
2006
Springer
13 years 9 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 7 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
DATE
2010
IEEE
129views Hardware» more  DATE 2010»
14 years 1 months ago
A power optimization method for CMOS Op-Amps using sub-space based geometric programming
—— A new sub-space max-monomial modeling scheme for CMOS transistors in sub-micron technologies is proposed to improve the modeling accuracy. Major electrical parameters of CMOS...
Wei Gao, Richard Hornsey