848 search results - page 132 / 170 » Randomness and the linear degrees of computability |
101
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
102
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
119
click to vote
ECAL
1995
Springer
15 years 3 months ago
1995
Springer
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
113
click to vote
CGF
2011
14 years 3 months ago
2011
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
ICDCS
2009
IEEE
15 years 9 months ago
2009
IEEE
In distributed storage systems, erasure codes represent an attractive solution to add redundancy to stored data while limiting the storage overhead. They are able to provide the s...