Sciweavers

349 search results - page 26 / 70
» Recursive Path Orderings Can Also Be Incremental
Sort
View
TON
2002
99views more  TON 2002»
13 years 7 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
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
ICPADS
2006
IEEE
14 years 1 months ago
Coloring the Internet: IP Traceback
Several IP Traceback schemes employing packet marking have been proposed to trace DoS/DDoS attacks that use source address spoofing. The major challenges in the design of an ef...
Muthusrinivasan Muthuprasanna, G. Manimaran, Manso...
JAIR
2007
124views more  JAIR 2007»
13 years 7 months ago
Closed-Loop Learning of Visual Control Policies
In this paper we present a general, flexible framework for learning mappings from images to actions by interacting with the environment. The basic idea is to introduce a feature-...
Sébastien Jodogne, Justus H. Piater