Sciweavers

3838 search results - page 115 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
109
Voted
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
15 years 10 months ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...
167
Voted
MOR
2007
149views more  MOR 2007»
15 years 3 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
134
Voted
ICCAD
1999
IEEE
88views Hardware» more  ICCAD 1999»
15 years 8 months ago
Performance optimization under rise and fall parameters
Typically,cell parameterssuch as the pin-to-pinintrinsicdelays, load-dependentcoe cients,andinputpin capacitanceshavedifferent values for rising and falling signals. The performan...
Rajeev Murgai
142
Voted
STOC
2005
ACM
133views Algorithms» more  STOC 2005»
16 years 3 months ago
An O(log n log log n) space algorithm for undirected st-connectivity
Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
Vladimir Trifonov
141
Voted
AMC
2004
115views more  AMC 2004»
15 years 3 months ago
Performance comparison of memetic algorithms
Local search techniques have been applied in optimization methods. The effect of local search to the memetic algorithms can make multimodal and non-linear problems easier to solve...
Jason G. Digalakis, Konstantinos G. Margaritis