19 search results - page 3 / 4 » Necessary Condition for Path Partitioning Constraints |
SPAA
2003
ACM
14 years 22 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— In this paper, we study the problem of exact emulation of two types of optical queues: (i) N-to-1 output-buffered multiplexers with variable length bursts, and (ii) N Ã...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— We introduce a method for constructing provably safe smooth feedback laws for car-like robots in obstaclecluttered polygonal environments. The robot is taken to be a point with...
ICCAD
1998
IEEE
13 years 11 months ago
1998
IEEE
Designers of distributed embedded systems face many challenges in determining the appropriate tradeoffs to make when defining a system architecture or retargeting an existing desi...
ADBIS
2004
Springer
14 years 27 days ago
2004
Springer
Web caching keeps single Web objects ready somewhere in caches in the user-to-server path, whereas database caching uses fullfledged database management systems as caches to adapt...