1612 search results - page 96 / 323 » Analysing Randomized Distributed Algorithms |
103
click to vote
SPAA
1992
ACM
15 years 6 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
122
click to vote
AAAI
2008
15 years 4 months ago
2008
Most standard learning algorithms, such as Logistic Regression (LR) and the Support Vector Machine (SVM), are designed to deal with i.i.d. (independent and identically distributed...
112
Voted
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
119
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
This paper analyses alternatives for the parallelization of the Simulated Annealing algorithm when applied to the placement of modules in a VLSI circuit considering the use of PVM...
109
click to vote
EUROPAR
2000
Springer
15 years 6 months ago
2000
Springer
We present a compiler algorithm called BitValue, which can discover both unused and constant bits in dusty-deck C programs. BitValue uses forward and backward dataflow analyses, ge...