438 search results - page 6 / 88 » Optimal Solvers for PDE-Constrained Optimization |
CP
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
SAC
2002
ACM
14 years 11 months ago
2002
ACM
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
SAT
2010
Springer
14 years 9 months ago
2010
Springer
Previous work has shown that circuit representations can be exploited in QBF solvers to obtain useful performance improvements. In this paper we examine some additional techniques ...
EUROPAR
2009
Springer
15 years 6 months ago
2009
Springer
The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse line...
PROCEDIA
2010
14 years 6 months ago
2010
We argue that producing maintainable high-performance implementations of finite element methods for multiple targets requires that they are written using a high-level domain-speci...