Sciweavers

173 search results - page 23 / 35
» Groups with poly-context-free word problem
Sort
View
BMCBI
2010
100views more  BMCBI 2010»
13 years 7 months ago
Using genomic signatures for HIV-1 sub-typing
Background: Human Immunodeficiency Virus type 1 (HIV-1), the causative agent of Acquired Immune Deficiency Syndrome (AIDS), exhibits very high genetic diversity with different var...
Aridaman Pandit, Somdatta Sinha
ISCI
2008
159views more  ISCI 2008»
13 years 7 months ago
Large scale evolutionary optimization using cooperative coevolution
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
Zhenyu Yang, Ke Tang, Xin Yao
ASC
2006
13 years 7 months ago
Speeding up the learning of equivalence classes of bayesian network structures
For some time, learning Bayesian networks has been both feasible and useful in many problems domains. Recently research has been done on learning equivalence classes of Bayesian n...
Rónán Daly, Qiang Shen, J. Stuart Ai...
JSS
2010
104views more  JSS 2010»
13 years 2 months ago
Using hybrid algorithm for Pareto efficient multi-objective test suite minimisation
Test suite minimisation techniques seek to reduce the effort required for regression testing by selecting a subset of test suites. In previous work, the problem has been considere...
Shin Yoo, Mark Harman
TALG
2010
86views more  TALG 2010»
13 years 6 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez