Sciweavers

12183 search results - page 2187 / 2437
» Computers under Attacks!
Sort
View
BICOB
2009
Springer
16 years 1 months ago
Assembly of Large Genomes from Paired Short Reads
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
WABI
2009
Springer
127views Bioinformatics» more  WABI 2009»
16 years 1 months ago
Constructing Majority-Rule Supertrees
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
Jianrong Dong, David Fernández-Baca, Fred R...
ATAL
2009
Springer
16 years 1 months ago
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...
ATAL
2009
Springer
16 years 1 months ago
Graph-based methods for the analysis of large-scale multiagent systems
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
Wilbur Peng, William Krueger, Alexander Grushin, P...
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
16 years 1 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
« Prev « First page 2187 / 2437 Last » Next »