Sciweavers

793 search results - page 85 / 159
» Analogical Path Planning
Sort
View
W2GIS
2004
Springer
14 years 1 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
SOICT
2010
13 years 2 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
CP
2005
Springer
14 years 1 months ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
HICSS
2011
IEEE
210views Biometrics» more  HICSS 2011»
12 years 12 months ago
Different Paths to Broadband Access: The Impact of Governance and Policy on Broadband Diffusion in the Developed and Developing
A new digital divide is emerging both within and between nations that is due to inequalities in broadband Internet access. Our research examines the broadband digital divide by an...
David J. Yates, Girish J. Gulati, Joseph W. Weiss
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 8 months ago
Building Computer Network Attacks
In this work we start walking the path to a new perspective for viewing cyberwarfare scenarios, by introducing conceptual tools (a formal model) to evaluate the costs of an attack...
Ariel Futoransky, Luciano Notarfrancesco, Gerardo ...