955 search results - page 45 / 191 » A System for Solving Constraint Satisfaction Problems with S... |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
ITS
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents an approach to the design of a learning environment in a mathematical domain (elementary combinatorics) where problem solving is based more on modelling than o...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Static resources allocation problems have been widely studied. More recently some of this attention has changed to focus on dynamic problems, where problem specifications, con...
CP
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
CP
2005
Springer
14 years 1 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...