146 search results - page 8 / 30 » Optimally Solving the MCM Problem Using Pseudo-Boolean Satis... |
85
Voted
TEC
2008
14 years 9 months ago
2008
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
119
Voted
CPAIOR
2010
Springer
14 years 7 months 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...
99
Voted
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
CP
2007
Springer
15 years 3 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
DISOPT
2008
14 years 9 months ago
2008
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...