293 search results - page 2 / 59 » Geometric algorithms for clearance based optimal path comput... |
MICS
2010
13 years 1 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
CAD
2008
Springer
13 years 6 months ago
2008
Springer
: This paper deals with optimization of 5-axis trajectories in the context of high-speed machining. The objective is to generate tool paths suited to high speed follow-up during ma...
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
13 years 10 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
SPAA
2005
ACM
13 years 11 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
TON
2002
13 years 5 months ago
2002
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...