Sciweavers

5046 search results - page 694 / 1010
» Non-redundant data clustering
Sort
View
GECCO
2008
Springer
182views Optimization» more  GECCO 2008»
15 years 8 months ago
Scaling ant colony optimization with hierarchical reinforcement learning partitioning
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...
Erik J. Dries, Gilbert L. Peterson
BMCBI
2007
149views more  BMCBI 2007»
15 years 7 months ago
A unified framework for finding differentially expressed genes from microarray experiments
Background: This paper presents a unified framework for finding differentially expressed genes (DEGs) from the microarray data. The proposed framework has three interrelated modul...
Jahangheer S. Shaik, Mohammed Yeasin
COMGEO
2010
ACM
15 years 7 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
IJHPCA
2010
105views more  IJHPCA 2010»
15 years 6 months ago
A Pipelined Algorithm for Large, Irregular All-Gather Problems
We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes in...
Jesper Larsson Träff, Andreas Ripke, Christia...
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
16 years 9 months ago
Efficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...