Sciweavers

1972 search results - page 205 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
148
Voted
IJCAI
2007
15 years 5 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
FGCS
2007
107views more  FGCS 2007»
15 years 4 months ago
Algorithmic re-structuring and data replication for protein structure comparison on a GRID
This paper describes a major restructuring of PROuST, a method for protein structure comparison, for an efficient porting to the Grid. PROuST consists of different components: an...
Giovanni Ciriello, M. Comin, Concettina Guerra
BMCBI
2006
115views more  BMCBI 2006»
15 years 4 months ago
Detecting recombination in evolving nucleotide sequences
Background: Genetic recombination can produce heterogeneous phylogenetic histories within a set of homologous genes. These recombination events can be obscured by subsequent resid...
Cheong Xin Chan, Robert G. Beiko, Mark A. Ragan
SC
2000
ACM
15 years 8 months ago
Scalable Algorithms for Adaptive Statistical Designs
We present a scalable, high-performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important class of learning al...
Robert H. Oehmke, Janis Hardwick, Quentin F. Stout
DCC
2005
IEEE
16 years 3 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said