Sciweavers

1040 search results - page 47 / 208
» Tools for modeling and solving search problems
Sort
View
CASES
2007
ACM
13 years 11 months ago
INTACTE: an interconnect area, delay, and energy estimation tool for microarchitectural explorations
Prior work on modeling interconnects has focused on optimizing the wire and repeater design for trading off energy and delay, and is largely based on low level circuit parameters....
Rahul Nagpal, Arvind Madan, Bharadwaj Amrutur, Y. ...
EC
2010
157views ECommerce» more  EC 2010»
13 years 7 months ago
Memetic Algorithms for Continuous Optimisation Based on Local Search Chains
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
Daniel Molina, Manuel Lozano, Carlos García...
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
13 years 8 months ago
Understanding elementary landscapes
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
Darrell Whitley, Andrew M. Sutton, Adele E. Howe
ESEC
1999
Springer
13 years 12 months ago
The CIP Method: Component- and Model-Based Construction of Embedded Systems
CIP is a model-based software development method for embedded systems. The problem of constructing an embedded system is decomposed into a functional and a connection problem. The ...
Hugo Fierz
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
13 years 7 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle