152 search results - page 11 / 31 » Linear Formulation of Constraint Programming Models and Hybr... |
ISCAS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
184
Voted
INFOCOM
2011
IEEE
14 years 27 days ago
2011
IEEE
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
SARA
2009
Springer
15 years 4 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
75
Voted
MJ
2007
14 years 9 months ago
2007
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...