Sciweavers

989 search results - page 160 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
SAC
2009
ACM
14 years 3 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
14 years 1 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
FPGA
1997
ACM
127views FPGA» more  FPGA 1997»
14 years 10 days ago
General Modeling and Technology-Mapping Technique for LUT-Based FPGAs
We present a general approach to the FPGA technology mapping problem that applies to any logic block composed of lookup tables LUTs and can yield optimal solutions. The connecti...
Amit Chowdhary, John P. Hayes
DATE
2009
IEEE
155views Hardware» more  DATE 2009»
14 years 2 days ago
Automatically mapping applications to a self-reconfiguring platform
The inherent reconfigurability of SRAM-based FPGAs enables the use of configurations optimized for the problem at hand. Optimized configurations are smaller and faster than their g...
Karel Bruneel, Fatma Abouelella, Dirk Stroobandt
ICCS
2007
Springer
14 years 2 months ago
Hessian-Based Model Reduction for Large-Scale Data Assimilation Problems
Assimilation of spatially- and temporally-distributed state observations into simulations of dynamical systems stemming from discretized PDEs leads to inverse problems with high-di...
Omar Bashir, Omar Ghattas, Judith Hill, Bart G. va...