227 search results - page 26 / 46 » Deterministic Sampling Algorithms for Network Design |
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
We address the design of complex monolithic systems, where processing cores generate and consume a varying and large amount of data, thus bringing the communication links to the e...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
PODS
2006
ACM
15 years 9 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
128
click to vote
SENSYS
2006
ACM
15 years 3 months ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...