12194 search results - page 2063 / 2439 » Numberings Optimal for Learning |
173
click to vote
GD
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
164
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...
184
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Several theoretical analyses of the dynamics of particle swarms have been offered in the literature over the last decade. Virtually all rely on substantial simplifications, incl...
167
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In many industrial applications the need for an efficient and high-quality reconstruction of free-form surfaces does exist. Surface Reconstruction – the generation of CAD models...
167
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...