Sciweavers

3142 search results - page 32 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
FLAIRS
2006
14 years 11 months ago
Which Dynamic Constraint Problems Can Be Solved By Ants?
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
Koenraad Mertens, Tom Holvoet, Yolande Berbers
WSC
2004
14 years 11 months ago
Solving Stochastic Mathematical Programs with Complementarity Constraints Using Simulation
Recently, simulation-based methods have been successfully used for solving challenging stochastic optimization problems and equilibrium models. Here we report some of the recent p...
S. Ilker Birbil, Gül Gürkan, Ovidiu List...
EVOW
2007
Springer
15 years 1 months ago
Evaluation of Different Metaheuristics Solving the RND Problem
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
14 years 7 months ago
Polynomial datapath optimization using constraint solving and formal modelling
For a variety of signal processing applications polynomials are implemented in circuits. Recent work on polynomial datapath optimization achieved significant reductions of hardware...
Finn Haedicke, Bijan Alizadeh, Görschwin Fey,...
ICCAD
2000
IEEE
88views Hardware» more  ICCAD 2000»
15 years 2 months ago
DRAGON2000: Standard-Cell Placement Tool for Large Industry Circuits
In this paper, we develop a new standard cell placement tool, Dragon2000, to solve large scale placement problem effectively. A top-down hierarchical approach is used in Dragon200...
Maogang Wang, Xiaojian Yang, Majid Sarrafzadeh