438 search results - page 13 / 88 » Optimal Solvers for PDE-Constrained Optimization |
HM
2009
Springer
15 years 4 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
CONSTRAINTS
2010
14 years 8 months ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
CP
2011
Springer
13 years 11 months ago
2011
Springer
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We calculate median adiabatic times (in seconds) of a specific superconducting adiabatic quantum processor for an NP-hard Ising spin glass instance class with up to N = 128 binary ...
AUTOMATICA
2010
14 years 9 months ago
2010
Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be transformed into Quadratic Programs (QPs). Model Predictive ...