Sciweavers

660 search results - page 41 / 132
» Hybrid CSP Solving
Sort
View
CISSE
2009
Springer
13 years 7 months ago
Optimal Component Selection for Component-Based Systems
In Component-based Software (CBS) development, it is desirable to choose software components that provide all necessary functionalities and at the same time optimize certain nonfun...
Muhammad Ali Khan, Sajjad Mahmood
COMPGEOM
2000
ACM
14 years 2 months ago
Fast software for box intersections
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler...
Afra Zomorodian, Herbert Edelsbrunner
GECCO
2010
Springer
182views Optimization» more  GECCO 2010»
14 years 1 months ago
Benchmarking CMA-EGS on the BBOB 2010 noisy function testbed
This paper describes the implementation and the results for CMA-EGS on the BBOB 2010 noisy testbed. The CMAEGS is a hybrid strategy which combines elements from gradient search an...
Steffen Finck, Hans-Georg Beyer
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 10 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
JPDC
2006
133views more  JPDC 2006»
13 years 9 months ago
Grid computing for parallel bioinspired algorithms
This paper focuses on solving large size combinatorial optimization problems using a Grid-enabled framework called ParadisEO
Nouredine Melab, Sébastien Cahon, El-Ghazal...