5592 search results - page 80 / 1119 » On Random Betweenness Constraints |
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
UAI
2003
13 years 11 months ago
2003
We propose a framework to extend Markov random walks (Szummer and Jaakkola, 2001) to a continuum of points. In this framework, the transition probability between two points is the...
TWC
2010
13 years 4 months ago
2010
In this paper, a primary (licensed) user leases part of its resources to independent secondary (unlicensed) terminals in exchange for a tariff in dollars per bit, under the constra...
SIAMCOMP
2012
12 years 12 days ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
ATAL
2008
Springer
14 years 21 hour ago
2008
Springer
We propose Markov random fields (MRFs) as a probabilistic mathematical model for unifying approaches to multi-robot coordination or, more specifically, distributed action selectio...