Sciweavers

6546 search results - page 236 / 1310
» Improving the Performance of the RISE Algorithm
Sort
View
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
AE
2007
Springer
16 years 21 days ago
Adaptive and Assortative Mating Scheme for Evolutionary Multi-Objective Algorithms
We are interested in the role of restricted mating schemes in the context of evolutionary multi-objective algorithms. In this paper, we propose an adaptive assortative mating schem...
Khoi Le, Dario Landa Silva
UAI
2008
15 years 8 months ago
New Techniques for Algorithm Portfolio Design
We present and evaluate new techniques for designing algorithm portfolios. In our view, the problem has both a scheduling aspect and a machine learning aspect. Prior work has larg...
Matthew J. Streeter, Stephen F. Smith
NIPS
2003
15 years 7 months ago
Prediction on Spike Data Using Kernel Algorithms
We report and compare the performance of different learning algorithms based on data from cortical recordings. The task is to predict the orientation of visual stimuli from the ac...
Jan Eichhorn, Andreas S. Tolias, Alexander Zien, M...
ICML
2010
IEEE
15 years 6 months ago
Nonparametric Information Theoretic Clustering Algorithm
In this paper we propose a novel clustering algorithm based on maximizing the mutual information between data points and clusters. Unlike previous methods, we neither assume the d...
Lev Faivishevsky, Jacob Goldberger