Sciweavers

33 search results - page 3 / 7
» Optimal Anytime Constrained Simulated Annealing for Constrai...
Sort
View
CEC
2008
IEEE
13 years 11 months ago
A feasibility-preserving local search operator for constrained discrete optimization problems
Abstract— Meta-heuristic optimization approaches are commonly applied to many discrete optimization problems. Many of these optimization approaches are based on a local search op...
Martin Lukasiewycz, Michael Glaß, Christian ...
ASPDAC
2000
ACM
154views Hardware» more  ASPDAC 2000»
13 years 9 months ago
Dynamic weighting Monte Carlo for constrained floorplan designs in mixed signal application
Simulated annealing has been one of the most popular stochastic optimization methods used in the VLSI CAD field in the past two decades for handling NP-hard optimization problems...
Jason Cong, Tianming Kong, Faming Liang, Jun S. Li...
EVOW
2009
Springer
13 years 10 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
JPDC
2006
187views more  JPDC 2006»
13 years 5 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
SCAI
2008
13 years 6 months ago
Towards Automatic Model Generation by Optimization
The problem of automatically selecting simulation models for autonomous agents depending on their current intentions and beliefs is considered in this paper. The intended use of t...
Per Nyblom, Patrick Doherty