5580 search results - page 199 / 1116 » Randomized priority algorithms |
139
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
139
Voted
CC
2008
Springer
15 years 5 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
100
Voted
JSYML
2011
14 years 12 months ago
2011
We show that the class of strongly jump-traceable c.e. sets can be characterised as those which have sufficiently slow enumerations so they obey a class of well-behaved cost functi...
163
click to vote
SPAA
2009
ACM
15 years 11 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
152
click to vote
CIKM
2007
Springer
15 years 11 months ago
2007
Springer
We present an evolutionary clustering method which can be applied to multi-relational knowledge bases storing resource annotations expressed in the standard languages for the Sema...