669 search results - page 25 / 134 » New Constraint Programming Approaches for the Computation of... |
TASE
2008
IEEE
13 years 8 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
AINA
2009
IEEE
14 years 3 months ago
2009
IEEE
This paper introduces a novel approach for modelling and specifying behaviors of Web services. This approach excludes Web services from any composition scenario and sheds the ligh...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—The problem of maximizing the sum of the transmit rates while limiting the outage probability below an appropriate threshold is investigated for networks where the nodes have li...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
ORL
2008
13 years 8 months ago
2008
We propose a novel solution approach for polynomial programming problems with equality constraints. By means of a generic transformation, we show that solution schemes for the (ty...