2434 search results - page 192 / 487 » Algorithmic Randomness of Closed Sets |
126
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
113
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
127
click to vote
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
123
click to vote
ISCC
2000
IEEE
15 years 8 months ago
2000
IEEE
We consider the adaptation of random early detection (RED) as a buffer management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTUs) are ...
110
click to vote
JGTOOLS
2006
15 years 4 months ago
2006
Poisson Disk sampling patterns are of interest to the graphics community because their blue-noise properties are desirable in sampling patterns for rendering, illumination, and ot...