Sciweavers

4860 search results - page 130 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
FSTTCS
2004
Springer
14 years 3 months ago
Genome Halving Problem Revisited
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
Max A. Alekseyev, Pavel A. Pevzner
CONCUR
2003
Springer
14 years 3 months ago
Synthesis of Distributed Algorithms Using Asynchronous Automata
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
Alin Stefanescu, Javier Esparza, Anca Muscholl
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
14 years 4 months ago
A particle swarm algorithm for symbols detection in wideband spatial multiplexing systems
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
Adnan Ahmed Khan, Muhammad Naeem, Syed Ismail Shah
FCT
2003
Springer
14 years 3 months ago
On Exact and Approximation Algorithms for Distinguishing Substring Selection
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
Jens Gramm, Jiong Guo, Rolf Niedermeier
JVA
2006
IEEE
14 years 4 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova