Sciweavers

895 search results - page 170 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
BMCBI
2008
124views more  BMCBI 2008»
13 years 8 months ago
Alignment of protein structures in the presence of domain motions
Background: Structural alignment is an important step in protein comparison. Well-established methods exist for solving this problem under the assumption that the structures under...
Roberto Mosca, Barbara Brannetti, Thomas R. Schnei...
BMCBI
2005
106views more  BMCBI 2005»
13 years 8 months ago
Thesaurus-based disambiguation of gene symbols
Background: Massive text mining of the biological literature holds great promise of relating disparate information and discovering new knowledge. However, disambiguation of gene s...
Bob J. A. Schijvenaars, Barend Mons, Marc Weeber, ...
JSAC
2008
140views more  JSAC 2008»
13 years 8 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
PPSN
2010
Springer
13 years 6 months ago
Defining and Optimizing Indicator-Based Diversity Measures in Multiobjective Search
Abstract. In this paper, we elaborate how decision space diversity can be integrated into indicator-based multiobjective search. We introduce DIOP, the diversity integrating multio...
Tamara Ulrich, Johannes Bader, Lothar Thiele
RECOMB
2000
Springer
14 years 5 hour ago
Contig selection in physical mapping
In physical mapping, one orders a set of genetic landmarks or a library of cloned fragments of DNA according to their position in the genome. Our approach to physical mapping divi...
Steffen Heber, Jens Stoye, Jörg D. Hoheisel, ...