Sciweavers

2294 search results - page 28 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
ANTSW
2010
Springer
14 years 4 months ago
Short and Robust Communication Paths in Dynamic Wireless Networks
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...
Yoann Pigné, Frédéric Guinand
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
DILS
2006
Springer
15 years 1 months ago
On Querying OBO Ontologies Using a DAG Pattern Query Language
The Open Biomedical Ontologies (OBO) is a consortium that serves as a repository of ontologies that are structured like directed acyclic graphs. In this paper we present a language...
Amarnath Gupta, Simone Santini
ALGORITHMICA
2011
14 years 4 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
CONCUR
2004
Springer
15 years 3 months ago
Model Checking Restricted Sets of Timed Paths
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
Nicolas Markey, Jean-François Raskin