14190 search results - page 2249 / 2838 » computer 2008 |
238
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
195
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
203
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
190
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
This paper compares three common evolutionary algorithms and our modified GA, a Distributed Adaptive Genetic Algorithm (DAGA). The optimal approach is sought to adapt, in near rea...
198
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
In e-learning initiatives content creators are usually required to arrange a set of learning resources in order to present them in a comprehensive way to the learner. Course mater...