251 search results - page 24 / 51 » Polynomial Time Algorithms for Three-Label Point Labeling |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
CCCG
2007
13 years 9 months ago
2007
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...
ACSC
2010
IEEE
13 years 2 months ago
2010
IEEE
One of the major challenges facing a present day game development company is the removal of bugs from such complex virtual environments. This work presents an approach for measuri...
ESA
1999
Springer
13 years 12 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...