2434 search results - page 142 / 487 » Algorithmic Randomness of Closed Sets |
165
click to vote
APPROX
2009
Springer
16 years 28 days ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
182
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
175
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
For the past few years researches have been investigating enhancing tracking performance by combining several different tracking algorithms. We propose an analytically justified, ...
188
click to vote
GLOBECOM
2006
IEEE
16 years 12 days ago
2006
IEEE
— We consider wireless multihop data networks with random multi-access mechanisms at the MAC layer. Our aim is to study the performance as perceived by users in a dynamic setting...
170
click to vote
EURONGI
2006
Springer
15 years 10 months ago
2006
Springer
We consider wireless multihop data networks with random multi-access mechanisms at the MAC layer. In general, our aim is to study the performance as perceived by users in a dynamic...