Sciweavers

Share
39 search results - page 8 / 8
» Nature inspired genetic algorithms for hard packing problems
Sort
View
PODC
2015
ACM
3 years 10 months ago
Distributed House-Hunting in Ant Colonies
We introduce the study of the ant colony house-hunting problem from a distributed computing perspective. When an ant colony’s nest becomes unsuitable due to size constraints or ...
Mohsen Ghaffari, Cameron Musco, Tsvetomira Radeva,...
ICIP
1999
IEEE
9 years 6 months ago
Motion Segmentation with Level Sets
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
Abdol-Reza Mansouri, Janusz Konrad
COCOON
2008
Springer
9 years 4 months ago
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
The problem of determining haplotypes from genotypes has gained considerable prominence in the research community since the beginning of the HapMap project. Here the focus is on de...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
MST
2006
149views more  MST 2006»
9 years 2 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
books