1594 search results - page 74 / 319 » An Algorithm to Compute Collusion Paths |
117
click to vote
ICRA
2006
IEEE
15 years 9 months ago
2006
IEEE
— This paper describes an off-line, iterative algorithm for simultaneous localization and mapping within large indoor environments. The proposed approach is based on the idea of ...
124
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
First, the covariance matrix adaptation (CMA) with rankone update is introduced into the (1+1)-evolution strategy. An improved implementation of the 1/5-th success rule is propose...
130
click to vote
CIAC
1997
Springer
15 years 7 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
151
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
137
click to vote
COMPGEOM
1998
ACM
15 years 7 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...