Sciweavers

23590 search results - page 418 / 4718
» Algorithm Performance Contest
Sort
View
ESA
2004
Springer
125views Algorithms» more  ESA 2004»
15 years 9 months ago
Approximation Algorithms for Quickest Spanning Tree Problems
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...
Refael Hassin, Asaf Levin
GECCO
2004
Springer
15 years 9 months ago
Real-Coded Bayesian Optimization Algorithm: Bringing the Strength of BOA into the Continuous World
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
Chang Wook Ahn, Rudrapatna S. Ramakrishna, David E...
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
15 years 9 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
ISCC
2003
IEEE
15 years 9 months ago
Pipelined Maximal Size Matching Scheduling Algorithms for CIOQ Switches.
In this paper, we propose new pipelined request-grant-accept (RGA) and request-grant (RG) maximal size matching (MSM) algorithms to achieve speedup in combined input and output qu...
Mei Yang, Si-Qing Zheng
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
15 years 9 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...