Sciweavers

5592 search results - page 185 / 1119
» On Random Betweenness Constraints
Sort
View
CORR
2010
Springer
67views Education» more  CORR 2010»
15 years 6 months ago
Using ATL to define advanced and flexible constraint model transformations
Abstract. Transforming constraint models is an important task in recent constraint programming systems. User-understandable models are defined during the modeling phase but rewriti...
Raphaël Chenouard, Laurent Granvilliers, Rica...
SIAMJO
2008
141views more  SIAMJO 2008»
15 years 6 months ago
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
Zi Xian Chan, Defeng Sun
CSUR
2000
69views more  CSUR 2000»
15 years 5 months ago
The framework approach for constraint satisfaction
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
Pierre Roy, Anne Liret, François Pachet
ANOR
2011
214views more  ANOR 2011»
15 years 1 months ago
A hybrid constraint programming approach to the log-truck scheduling problem
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
Nizar El Hachemi, Michel Gendreau, Louis-Martin Ro...
DAC
2006
ACM
16 years 7 months ago
Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute i...
Sander Stuijk, Marc Geilen, Twan Basten