Sciweavers

1951 search results - page 352 / 391
» An algorithm for improving graph partitions
Sort
View
RSS
2007
147views Robotics» more  RSS 2007»
14 years 11 months ago
Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
ICWSM
2009
14 years 7 months ago
Gephi: An Open Source Software for Exploring and Manipulating Networks
Gephi is an open source software for graph and network analysis. It uses a 3D render engine to display large networks in real-time and to speed up the exploration. A flexible and ...
Mathieu Bastian, Sebastien Heymann, Mathieu Jacomy
GIS
2009
ACM
15 years 11 months ago
Map-Matching for Low-Sampling-Rate GPS Trajectories
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...
Yin Lou, Chengyang Zhang, Yu Zheng, Xing Xie, Wei ...
PC
2010
196views Management» more  PC 2010»
14 years 8 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak
ATAL
2009
Springer
15 years 4 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...