58 search results - page 10 / 12 » A Quantifier Elimination Algorithm for Linear Real Arithmeti... |
GECCO
2004
Springer
14 years 26 days ago
2004
Springer
Hybrid algorithms that combine genetic algorithms with the Nelder-Mead simplex algorithm have been effective in solving certain optimization problems. In this article, we apply a s...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
ALGORITHMICA
2010
13 years 7 months ago
2010
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
ICALP
2004
Springer
14 years 26 days ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
WLP
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...