553 search results - page 50 / 111 » On Planar Path Transformation |
118
click to vote
TON
2008
14 years 11 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
ICSE
2009
IEEE-ACM
16 years 20 days ago
2009
IEEE-ACM
A variety of compilers, static analyses, and testing frameworks rely heavily on path frequency information. Uses for such information range from optimizing transformations to bug ...
100
click to vote
ESA
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
MICRO
2000
IEEE
14 years 11 months ago
2000
IEEE
This paper demonstrates how an Instruction Path Coprocessor (I-COP) can be efficiently implemented using the PipeRench reconfigurable architecture. An I-COP is a programmable on-c...
JIRS
1998
14 years 11 months ago
1998
After a brief review of the current research on multi-robot systems, the paper presents a path planning and control scheme for a cooperative three-robot system transferring/manipul...