172 search results - page 32 / 35 » Planar Graphs with Topological Constraints |
168
Voted
AINA
2007
IEEE
16 years 5 days ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
156
click to vote
SIGCOMM
2004
ACM
15 years 11 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
157
click to vote
ICCAD
2000
IEEE
15 years 10 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
160
click to vote
RAS
2007
15 years 5 months ago
2007
In this paper we start from a set of images obtained by the robot that is moving around in an environment. We present a method to automatically group the images into groups that c...
167
click to vote
WETICE
2007
IEEE
16 years 2 days ago
2007
IEEE
Designing a collaborative architecture for real-time applications is an intricate challenge that usually involves dealing with the real-time constraints, resource limitations and ...