Sciweavers

2434 search results - page 161 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
GD
2004
Springer
15 years 9 months ago
Convex Drawings of 3-Connected Plane Graphs
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
INFOCOM
2007
IEEE
15 years 10 months ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz
INFOSCALE
2007
ACM
15 years 5 months ago
A distributed incremental nearest neighbor algorithm
Searching for non-text data (e.g., images) is mostly done by means of metadata annotations or by extracting the text close to the data. However, supporting real content-based audi...
Fabrizio Falchi, Claudio Gennaro, Fausto Rabitti, ...
EOR
2006
118views more  EOR 2006»
15 years 3 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
133
Voted
RAS
2000
130views more  RAS 2000»
15 years 3 months ago
Allocating optimal index positions on tool magazines using genetic algorithms
This paper presents an optimisation system software developed for the determination of optimal index positions of cutting tools on the automatic tool changer (ATC) or turret magaz...
Türkay Dereli, I. Hüseyin Filiz