1040 search results - page 116 / 208 » Rounding algorithms for covering problems |
CEC
2007
IEEE
15 years 1 months ago
2007
IEEE
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
JSW
2008
14 years 9 months ago
2008
- In the Software Product Line approach, product configuration is a key activity in which stakeholders choose features for a product. This activity is critical in the sense that ca...
CSB
2004
IEEE
15 years 1 months ago
2004
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an ade...
QEST
2009
IEEE
15 years 4 months ago
2009
IEEE
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...