765 search results - page 1 / 153 » Empirical Design of Geometric Algorithms |
COMPGEOM
1999
ACM
13 years 9 months ago
1999
ACM
The computer--aidedsolution to algorithmic problemsis becoming moreandmoreimportant in variousapplicationdomains.This is in particular true for computationalgeometry.For example,g...
SASO
2008
IEEE
13 years 11 months ago
2008
IEEE
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
ALGORITHMICA
2002
13 years 4 months ago
2002
The implementation of an algorithm is faced with the issues efficiency, flexibility, and ease-of-use. In this paper, we suggest a design concept that greatly increases the flexibi...