3838 search results - page 79 / 768 » Techniques for Optimization of Net Algorithms |
105
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Recent theoretical work helped explain certain optimizationrelated pathologies in cooperative coevolutionary algorithms (CCEAs). Such explanations have led to adopting sp...
129
Voted
SODA
1994
ACM
15 years 4 months ago
1994
ACM
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
122
Voted
CEC
2009
IEEE
15 years 6 months ago
2009
IEEE
— The urban transit routing problem (UTRP) for public transport systems involves finding a set of efficient transit routes to meet customer demands. The UTRP is an NPHard, high...
159
Voted
IPCO
2004
15 years 4 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
114
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...