691 search results - page 78 / 139 » Genetic Programming Applied to Mixed Integer Programming |
129
click to vote
WIOPT
2010
IEEE
15 years 22 days ago
2010
IEEE
We consider the resource allocation (RA) problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each ba...
101
Voted
APLAS
2009
ACM
15 years 7 months ago
2009
ACM
We study the resource calculus – the non-lazy version of Boudol’s λ-calculus with resources. In such a calculus arguments may be finitely available and mixed, giving rise to ...
134
click to vote
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
182
click to vote
CPAIOR
2010
Springer
15 years 27 days ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
109
click to vote
CPAIOR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...