Sciweavers

867 search results - page 53 / 174
» On Optimization of Test Parallelization with Constraints
Sort
View
CP
1995
Springer
14 years 16 days ago
Optimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Javier Larrosa, Pedro Meseguer
DSD
2009
IEEE
126views Hardware» more  DSD 2009»
14 years 26 days ago
Architecture-Driven Synthesis of Reconfigurable Cells
In this paper, we present a novel method for merging sets of computational patterns into a reconfigurable cell respecting design constraints and optimizing specific design aspects...
Christophe Wolinski, Krzysztof Kuchcinski, Erwan R...
GECCO
2006
Springer
123views Optimization» more  GECCO 2006»
14 years 19 days ago
The parallel Nash Memory for asymmetric games
Coevolutionary algorithms search for test cases as part of the search process. The resulting adaptive evaluation function takes away the need to define a fixed evaluation function...
Frans A. Oliehoek, Edwin D. de Jong, Nikos A. Vlas...
ICCV
2003
IEEE
14 years 11 months ago
Landmark-based Shape Deformation with Topology-Preserving Constraints
This paper presents a novel approach for landmarkbased shape deformation, in which fitting error and shape difference are formulated into a support vector machine (SVM) regression...
Song Wang, Jim Xiuquan Ji, Zhi-Pei Liang
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 10 months ago
A parallel evolutionary algorithm for unconstrained binary quadratic problems
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
István Borgulya