7228 search results - page 174 / 1446 » From Algorithmic to Subjective Randomness |
141
click to vote
PEWASUN
2005
ACM
15 years 9 months ago
2005
ACM
Scalability issues for routing in mobile ad hoc networks (MANETs) have been typically addressed using hybrid routing schemes operating in a hierarchical network architecture. Seve...
128
Voted
SIAMCOMP
2010
15 years 2 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
155
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
150
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
146
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Uncertain data streams, where data is incomplete, imprecise, and even misleading, have been observed in many environments. Feeding such data streams to existing stream systems pro...