Sciweavers

2294 search results - page 236 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
CMOT
2010
176views more  CMOT 2010»
15 years 19 days ago
A cognitive model of spatial path-planning
Planning a path to a destination, given a number of options and obstacles, is a common task. We suggest a two-component cognitive model that combines retrieval of knowledge about t...
David Reitter, Christian Lebiere
PAM
2011
Springer
14 years 6 months ago
On the Feasibility of Bandwidth Detouring
Internet applications that route data over default Internet paths can often increase performance by sending their traffic over alternative “detour” paths. Previous work has sho...
Thom Haddow, Sing Wang Ho, Jonathan Ledlie, Cristi...
IJCGA
2010
78views more  IJCGA 2010»
15 years 15 days ago
Operations Preserving Global Rigidity of Generic Direction-Length Frameworks
A two-dimensional direction-length framework is a pair (G, p), where G = (V ; D, L) is a graph whose edges are labeled as `direction' or `length' edges, and a map p from...
Bill Jackson, Tibor Jordán
DAGSTUHL
2006
15 years 4 months ago
Rule-based Model Extraction from Source Code
Abstract. In the context of an approach for reengineering legacy software systems at the architectural level, we present in this paper a reverse engineering methodology that uses a...
Rui Correia, Carlos M. P. Matos, Mohammad El-Ramly...
ICDM
2010
IEEE
117views Data Mining» more  ICDM 2010»
15 years 1 months ago
Node Similarities from Spreading Activation
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...
Kilian Thiel, Michael R. Berthold