Sciweavers

2814 search results - page 203 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
TSP
2010
14 years 7 months ago
Independent component analysis by entropy bound minimization
A novel (differential) entropy estimator is introduced where the maximum entropy bound is used to approximate the entropy given the observations, and is computed using a numerical ...
Xi-Lin Li, Tülay Adali
113
Voted
AMC
2007
108views more  AMC 2007»
15 years 27 days ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh
94
Voted
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
15 years 7 months ago
A systemic computation platform for the modelling and analysis of processes with natural characteristics
Computation in biology and in conventional computer architectures seem to share some features, yet many of their important characteristics are very different. To address this, [1]...
Erwan Le Martelot, Peter J. Bentley, R. Beau Lotto
KES
1999
Springer
15 years 5 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli
MIR
2003
ACM
213views Multimedia» more  MIR 2003»
15 years 6 months ago
Replication algorithms to retrieve scalable streaming media over Content Delivery Networks
CDN (Content Delivery Networks) improves end-user performance by replicating web contents on a group of geographically distributed content servers. Replication Algorithm plays an ...
Zhou Su, Jiro Katto, Yasuhiko Yasuda