Sciweavers

19 search results - page 4 / 4
» Sorting and Selection with Imprecise Comparisons
Sort
View
BMCBI
2007
106views more  BMCBI 2007»
13 years 5 months ago
Constructing a meaningful evolutionary average at the phylogenetic center of mass
Background: As a consequence of the evolutionary process, data collected from related species tend to be similar. This similarity by descent can obscure subtler signals in the dat...
Eric A. Stone, Arend Sidow
VLDB
2007
ACM
155views Database» more  VLDB 2007»
14 years 5 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 5 months ago
A Performance Study of GA and LSH in Multiprocessor Job Scheduling
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
S. R. Vijayalakshmi, G. Padmavathi
CEC
2009
IEEE
14 years 2 days ago
A multi-objective approach to Redundancy Allocation Problem in parallel-series systems
— The Redundancy Allocation Problem (RAP) is a kind of reliability optimization problems. It involves the selection of components with appropriate levels of redundancy or reliabi...
Zai Wang, Tianshi Chen, Ke Tang, Xin Yao