Sciweavers

1197 search results - page 34 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
CCE
2004
13 years 9 months ago
An MPEC formulation for dynamic optimization of distillation operations
We consider the dynamic optimization of chemical processes with changes in the number of equilibrium phases. Recent work has shown that transitions in the number of phases can be ...
Arvind U. Raghunathan, M. Soledad Diaz, Lorenz T. ...
VLSID
2003
IEEE
103views VLSI» more  VLSID 2003»
14 years 9 months ago
Minimum Dynamic Power CMOS Circuit Design by a Reduced Constraint Set Linear Program
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
Tezaswi Raja, Vishwani D. Agrawal, Michael L. Bush...
CPAIOR
2004
Springer
14 years 2 months ago
Stabilization Issues for Constraint Programming Based Column Generation
Abstract. Constraint programming based column generation is a hybrid optimization framework recently proposed that uses constraint programming (CP) to solve column generation subpr...
Louis-Martin Rousseau
JAIR
2010
130views more  JAIR 2010»
13 years 7 months ago
A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
Bonny Banerjee, B. Chandrasekaran
CP
2009
Springer
14 years 9 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný