Sciweavers

305 search results - page 15 / 61
» Geometric programming for circuit optimization
Sort
View
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 6 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
ICPR
2008
IEEE
16 years 28 days ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
ECCV
2010
Springer
15 years 2 months ago
Practical Methods For Convex Multi-View Reconstruction
Globally optimal formulations of geometric computer vision problems comprise an exciting topic in multiple view geometry. These approaches are unaffected by the quality of a provid...
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
15 years 5 months ago
Artificial immune system for solving generalized geometric problems: a preliminary results
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
Jui-Yu Wu, Yun-Kung Chung
DAC
2006
ACM
16 years 21 days ago
Optimal simultaneous mapping and clustering for FPGA delay optimization
Both technology mapping and circuit clustering have a large impact on FPGA designs in terms of circuit performance, area, and power dissipation. Existing FPGA design flows carry o...
Joey Y. Lin, Deming Chen, Jason Cong