Sciweavers

3838 search results - page 134 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
15 years 9 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
GECCO
2006
Springer
237views Optimization» more  GECCO 2006»
15 years 7 months ago
Genetic algorithms to optimise the time to make stock market investment
The application of Artificial Intelligence described in this article is intended to resolve the issue of speculation on the stock market. Genetic Algorithms is the technique that ...
David de la Fuente, Alejandro Garrido, Jaime Lavia...
WSC
1997
15 years 5 months ago
Single Run Optimization Using the Reverse-Simulation Method
An efficient “Simulation Optimization” technique is developed to solve system design problems which can not be expressed in explicit analytical or mathematical models. In part...
Young Hae Lee, Kyoung Jong Park, Yun Bae Kim
TCAD
2008
195views more  TCAD 2008»
15 years 3 months ago
Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu, Meng-X...
ASPDAC
2007
ACM
121views Hardware» more  ASPDAC 2007»
15 years 7 months ago
Approximation Algorithm for Process Mapping on Network Processor Architectures
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
Christopher Ostler, Karam S. Chatha, Goran Konjevo...