Sciweavers

36 search results - page 6 / 8
» Accelerated Genetic Algorithms with Markov Chains
Sort
View
DCC
2010
IEEE
15 years 4 months ago
An MCMC Approach to Lossy Compression of Continuous Sources
Motivated by the Markov chain Monte Carlo (MCMC) relaxation method of Jalali and Weissman, we propose a lossy compression algorithm for continuous amplitude sources that relies on...
Dror Baron, Tsachy Weissman
BIOCOMP
2010
14 years 6 months ago
Using the Genetic Code Wisdom for Recognizing Protein Coding Sequences
We have elaborated a new method of recognizing protein coding sequences in genomic sequences. The method is exploiting a specific way of genetic code degeneration and relations bet...
Pawel Blazej, Pawel Mackiewicz, Stanislaw Cebrat
INFOCOM
2009
IEEE
15 years 4 months ago
The Impact of Mobility on Gossip Algorithms
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
Anand D. Sarwate, Alexandros G. Dimakis
AI
2006
Springer
14 years 9 months ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon
DKE
2007
95views more  DKE 2007»
14 years 9 months ago
Strategies for improving the modeling and interpretability of Bayesian networks
One of the main factors for the knowledge discovery success is related to the comprehensibility of the patterns discovered by applying data mining techniques. Amongst which we can...
Ádamo L. de Santana, Carlos Renato Lisboa F...