Sciweavers

2814 search results - page 271 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
15 years 6 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 6 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
134
Voted
JCB
2006
124views more  JCB 2006»
15 years 16 days ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
BMCBI
2011
14 years 7 months ago
RAIphy: Phylogenetic classification of metagenomics samples using iterative refinement of relative abundance index profiles
Background: Computational analysis of metagenomes requires the taxonomical assignment of the genome contigs assembled from DNA reads of environmental samples. Because of the diver...
Ozkan U. Nalbantoglu, Samuel F. Way, Steven H. Hin...
132
Voted
CORR
2011
Springer
142views Education» more  CORR 2011»
14 years 4 months ago
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
Stefan Edelkamp