Sciweavers

4342 search results - page 344 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
15 years 10 months ago
"Optimal" mutation rates for genetic search
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
Jorge Cervantes, Christopher R. Stephens
AIIDE
2008
15 years 9 months ago
Stochastic Plan Optimization in Real-Time Strategy Games
We present a domain independent off-line adaptation technique called Stochastic Plan Optimization for finding and improving plans in real-time strategy games. Our method is based ...
Andrew Trusty, Santiago Ontañón, Ash...
WSC
2007
15 years 9 months ago
Allocation of simulation runs for simulation optimization
Simulation optimization (SO) is the process of finding the optimum design of a system whose performance measure(s) are estimated via simulation. We propose some ideas to improve o...
Alireza Kabirian, Sigurdur Ólafsson
ICCAD
2007
IEEE
281views Hardware» more  ICCAD 2007»
16 years 3 months ago
Archer: a history-driven global routing algorithm
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
Muhammet Mustafa Ozdal, Martin D. F. Wong
GECCO
2003
Springer
132views Optimization» more  GECCO 2003»
16 years 15 hour ago
Circuit Bipartitioning Using Genetic Algorithm
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
Jong-Pil Kim, Byung Ro Moon