Sciweavers

43 search results - page 4 / 9
» Shorter Path Constraints for the Resource Constrained Shorte...
Sort
View
TIP
2010
115views more  TIP 2010»
13 years 23 days ago
Constrained and Dimensionality-Independent Path Openings
Abstract--Path openings and closings are morphological operations with flexible line segments as structuring elements. These line segments have the ability to adapt to local image ...
Cris L. Luengo Hendriks
TON
2002
99views more  TON 2002»
13 years 5 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
JPDC
2006
187views more  JPDC 2006»
13 years 6 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
COMCOM
2006
75views more  COMCOM 2006»
13 years 6 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
CP
2005
Springer
13 years 11 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