16091 search results - page 364 / 3219 » Solving |
137
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
171
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we present an empirical comparison of some Differential Evolution variants to solve global optimization problems. The aim is to identify which one of them is more s...
161
Voted
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
200
Voted
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
186
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...