Sciweavers

882 search results - page 49 / 177
» Local Search for Very Large SAT Problems
Sort
View
GECCO
2006
Springer
122views Optimization» more  GECCO 2006»
15 years 3 months ago
Genetic algorithms are suitable for driving microbial ecosystems in desirable directions
The behavior of natural, biological ecosystems is for a large part determined by environmental conditions. It should therefore be possible to experimentally manipulate such condit...
Frederik P. J. Vandecasteele, Thomas F. Hess, Rona...
AAAI
2007
15 years 2 months ago
Randomized Adaptive Spatial Decoupling for Large-Scale Vehicle Routing with Time Windows
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
Russell Bent, Pascal Van Hentenryck
ALMOB
2006
155views more  ALMOB 2006»
14 years 12 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
DAM
2000
137views more  DAM 2000»
14 years 11 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
BMCBI
2010
173views more  BMCBI 2010»
14 years 12 months ago
The Yeast Resource Center Public Image Repository: A large database of fluorescence microscopy images
Background: There is increasing interest in the development of computational methods to analyze fluorescent microscopy images and enable automated large-scale analysis of the subc...
Michael Riffle, Trisha N. Davis