616 search results - page 41 / 124 » Hybrid Numerical Optimization for Combinatorial Network Prob... |
111
Voted
CEC
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
127
click to vote
PPSN
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
103
click to vote
AMC
2007
15 years 19 days ago
2007
The particle swarm optimization algorithm was showed to converge rapidly during the initial stages of a global search, but around global optimum, the search process will become ve...
118
click to vote
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Genetic algorithms have been a standard technique for engineers optimising water distribution networks for some time. However in recent years there has been an increasing...
94
Voted
COMCOM
2010
15 years 18 days ago
2010
We study the interaction between the MIMD (Multiplicative Increase Multiplicative Decrease) congestion control and a bottleneck router with Drop Tail buffer. We consider the probl...