Sciweavers

17760 search results - page 360 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
SPAA
2005
ACM
16 years 1 months ago
Efficient algorithms for verifying memory consistency
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
Chaiyasit Manovit, Sudheendra Hangal
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
16 years 29 days ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
ISAAC
2005
Springer
89views Algorithms» more  ISAAC 2005»
16 years 28 days ago
Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Le...
198
Voted
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
16 years 28 days ago
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
Hao Yuan, Linji Yang, Erdong Chen
169
Voted
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
16 years 21 days ago
PCG: a foothold selection algorithm for spider robot locomotion in 2D tunnels
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
Amir Shapiro, Elon Rimon