Sciweavers

6 search results - page 1 / 2
» Binary Pathfinder: An improvement to the Pathfinder algorith...
Sort
View
IPM
2006
94views more  IPM 2006»
13 years 4 months ago
Binary Pathfinder: An improvement to the Pathfinder algorithm
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
Vicente P. Guerrero Bote, Felipe Zapico-Alonso, Ma...
AAAI
2010
13 years 6 months ago
Finding Optimal Solutions to Cooperative Pathfinding Problems
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first...
Trevor Scott Standley
ATAL
2008
Springer
13 years 6 months ago
A new approach to cooperative pathfinding
In the multi-agent pathfinding problem, groups of agents need to plan paths between their respective start and goal locations in a given environment, usually a two-dimensional map...
M. Renee Jansen, Nathan R. Sturtevant
MICCAI
2006
Springer
14 years 5 months ago
Fast and Accurate Connectivity Analysis Between Functional Regions Based on DT-MRI
Diffusion tensor and functional MRI data provide insight into function and structure of the human brain. However, connectivity analysis between functional areas is still a challeng...
Dorit Merhof, Mirco Richter, Frank Enders, Peter H...
IDA
2010
Springer
13 years 6 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou