828 search results - page 10 / 166 » Bounded Hairpin Completion |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algori...
ICRA
2002
IEEE
14 years 14 days ago
2002
IEEE
We present a complete, local, and parallel reconfiguration algorithm for metamorphic robots made up of Telecubes, six degree of freedom cube shaped modules currently being develop...
SIAMDM
2010
13 years 2 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimiz...