Sciweavers

9849 search results - page 161 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
ICEC
1994
86views more  ICEC 1994»
15 years 6 months ago
A Genetic Algorithm for Channel Routing using Inter-Cluster Mutation
In this paper, we propose an algorithm for the channel routing problem based on genetic approach that uses a new type of mutation, called inter-cluster mutation . The performance ...
B. B. Prahlada Rao, Lalit M. Patnaik, R. C. Hansda...
ISMB
1993
15 years 6 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
DSD
2010
IEEE
135views Hardware» more  DSD 2010»
15 years 5 months ago
An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F...
IJCBDD
2008
141views more  IJCBDD 2008»
15 years 4 months ago
CLUSS2: an alignment-independent algorithm for clustering protein families with multiple biological functions
: CLUSS is an algorithm proposed for clustering both alignable and non-alignable protein sequences. However, CLUSS tends to be ineffective on protein datasets that include a large ...
Abdellali Kelil, Shengrui Wang, Ryszard Brzezinski
JCP
2008
145views more  JCP 2008»
15 years 4 months ago
An Effective Mining Algorithm for Weighted Association Rules in Communication Networks
The mining of weighted association rules is one of the primary methods used in communication alarm correlation analysis. With large communication alarm database, the traditional me...
Jian Wu, Xing ming Li