Sciweavers

2304 search results - page 264 / 461
» On the Vulnerability of Large Graphs
Sort
View
SLS
2009
Springer
250views Algorithms» more  SLS 2009»
16 years 1 months ago
Running Time Analysis of ACO Systems for Shortest Path Problems
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
Christian Horoba, Dirk Sudholt
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
16 years 1 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
IROS
2007
IEEE
198views Robotics» more  IROS 2007»
16 years 28 days ago
Topological mapping, localization and navigation using image collections
Abstract— In this paper we present a highly scalable visionbased localization and mapping method using image collections. A topological world representation is created online dur...
Friedrich Fraundorfer, Christopher Engels, David N...
IROS
2007
IEEE
125views Robotics» more  IROS 2007»
16 years 27 days ago
Hybrid localization using the hierarchical atlas
— This paper presents a hybrid localization scheme for a mobile robot using the hierarchical atlas. The hierarchical atlas is a map that consists of a higher level topological gr...
Stephen Tully, Hyungpil Moon, Deryck Morales, Geor...
COCOA
2007
Springer
16 years 24 days ago
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
Lanbo Zheng, Christoph Buchheim