Sciweavers

1563 search results - page 124 / 313
» Performance comparison of memetic algorithms
Sort
View
128
Voted
TEC
2002
120views more  TEC 2002»
15 years 3 months ago
Optimization based on bacterial chemotaxis
We present an optimization algorithm based on a model of bacterial chemotaxis. The original biological model is used to formulate a simple optimization algorithm, which is evaluate...
Sibylle D. Müller, Jarno Marchetto, Stefano A...
140
Voted
PPOPP
2012
ACM
13 years 11 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
IJCAI
2003
15 years 4 months ago
First-order probabilistic inference
Most probabilistic inference algorithms are specified and processed on a propositional level. In the last decade, many proposals for algorithms accepting first-order specificat...
David Poole
112
Voted
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 3 months ago
Pairwise Optimal Discrete Coverage Control for Gossiping Robots
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
Joseph W. Durham, Ruggero Carli, Francesco Bullo
167
Voted
TKDE
2012
212views Formal Methods» more  TKDE 2012»
13 years 5 months ago
Segmentation and Sampling of Moving Object Trajectories Based on Representativeness
—Moving Object Databases (MOD), although ubiquitous, still call for methods that will be able to understand, search, analyze, and browse their spatiotemporal content. In this pap...
Costas Panagiotakis, Nikos Pelekis, Ioannis Kopana...