Sciweavers

552 search results - page 38 / 111
» Observable Graphs
Sort
View
IROS
2009
IEEE
151views Robotics» more  IROS 2009»
14 years 2 months ago
A comparison of SLAM algorithms based on a graph of relations
— In this paper, we address the problem of creating an objective benchmark for comparing SLAM approaches. We propose a framework for analyzing the results of SLAM approaches base...
Wolfram Burgard, Cyrill Stachniss, Giorgio Grisett...
WAW
2007
Springer
85views Algorithms» more  WAW 2007»
14 years 2 months ago
A Spatial Web Graph Model with Local Influence Regions
We present a new stochastic model for complex networks, based on a spatial embedding of the nodes, called the Spatial Preferred Attachment (SPA) model. In the SPA model, nodes have...
William Aiello, Anthony Bonato, C. Cooper, Jeannet...
INFOCOM
2006
IEEE
14 years 2 months ago
Sampling Techniques for Large, Dynamic Graphs
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
ECAI
2000
Springer
13 years 11 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
SIAMDM
2010
117views more  SIAMDM 2010»
13 years 6 months ago
Design is as Easy as Optimization
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vaz...