Sciweavers

3136 search results - page 600 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
AAAI
1994
15 years 1 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
GLOBECOM
2007
IEEE
14 years 12 months ago
Multi-Class QoS in 802.11 Networks Using Gentle Decrease of Multiple Contention Windows
—IEEE 802.11 Distributed Coordination Function (DCF) uses a binary exponential backoff algorithm to arbitrate simultaneous channel access by multiple stations. When a station sen...
Bushra Anjum, Zartash Afzal Uzmi
BMCBI
2010
126views more  BMCBI 2010»
14 years 12 months ago
Cgaln: fast and space-efficient whole-genome alignment
Background: Whole-genome sequence alignment is an essential process for extracting valuable information about the functions, evolution, and peculiarities of genomes under investig...
Ryuichiro Nakato, Osamu Gotoh
BMCBI
2007
143views more  BMCBI 2007»
14 years 12 months ago
RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...
Yair Horesh, Tirza Doniger, Shulamit Michaeli, Ron...
BMCBI
2007
135views more  BMCBI 2007»
14 years 12 months ago
Measuring similarities between gene expression profiles through new data transformations
Background: Clustering methods are widely used on gene expression data to categorize genes with similar expression profiles. Finding an appropriate (dis)similarity measure is crit...
Kyungpil Kim, Shibo Zhang, Keni Jiang, Li Cai, In-...