Sciweavers

4908 search results - page 12 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
BMCBI
2010
161views more  BMCBI 2010»
14 years 9 months ago
LTC: a novel algorithm to improve the efficiency of contig assembly for physical mapping in complex genomes
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
Zeev Frenkel, Etienne Paux, David I. Mester, Cathe...
PODS
2004
ACM
101views Database» more  PODS 2004»
15 years 11 months ago
Synopses for Query Optimization: A Space-Complexity Perspective
Raghav Kaushik, Raghu Ramakrishnan, Venkatesan T. ...
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
15 years 5 months ago
Complex networks and evolutionary computation
Carlos Cotta, Juan Julián Merelo Guerv&oacu...
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
15 years 5 months ago
Computational complexity and evolutionary computation
Thomas Jansen, Frank Neumann
DEDS
2006
78views more  DEDS 2006»
14 years 11 months ago
The Equivalence between Ordinal Optimization in Deterministic Complex Problems and in Stochastic Simulation Problems
In the last decade ordinal optimization (OO) has been successfully applied in many stochastic simulation-based optimization problems (SP) and deterministic complex problems (DCP). ...
Yu-Chi Ho, Qing-Shan Jia, Qianchuan Zhao