Sciweavers

4212 search results - page 815 / 843
» On Compressible Pairings and Their Computation
Sort
View
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
15 years 11 months ago
Improving EAX with restricted 2-opt
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Hua...
MMMACNS
2005
Springer
15 years 11 months ago
Networks, Markov Lie Monoids, and Generalized Entropy
The continuous general linear group in n dimensions can be decomposed into two Lie groups: (1) an n(n-1) dimensional ‘Markov type’ Lie group that is defined by preserving the ...
Joseph E. Johnson
OR
2005
Springer
15 years 11 months ago
Optimal Fares for Public Transport
The fare planning problem for public transport is to design a system of fares that maximize the revenue. We introduce a nonlinear optimization model to approach this problem. It i...
Ralf Borndörfer, Marika Neumann, Marc E. Pfet...
SEMWEB
2005
Springer
15 years 11 months ago
RelExt: A Tool for Relation Extraction from Text in Ontology Extension
Abstract. Domain ontologies very rarely model verbs as relations holding between concepts. However, the role of the verb as a central connecting element between concepts is undenia...
Alexander Schutz, Paul Buitelaar
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
15 years 11 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...