Results 1  10
of
69,284
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
ArcDisjoint Paths in Expander Digraphs
"... Abstract Given a digraph D = (V; A) and a set of ^ pairs of vertices in V, we are interestedin finding, for each pair (x i; yi), a directed path connecting xi to yi such that the setof ^ paths so found is arcdisjoint. For arbitrary graphs the problem is N Pcomplete, even for ^ = 2.We present a po ..."
Abstract
 Add to MetaCart
Abstract Given a digraph D = (V; A) and a set of ^ pairs of vertices in V, we are interestedin finding, for each pair (x i; yi), a directed path connecting xi to yi such that the setof ^ paths so found is arcdisjoint. For arbitrary graphs the problem is N Pcomplete, even for ^ = 2.We present a
ArcDisjoint Paths in Expander Digraphs
 IN PROCEEDINGS OF THE 42ND ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 2001
"... Given a digraph D = (V, A) and a set of n pairs of vertices in V, we axe interested in finding for each pair (xi, Yi), a directed path connecting xi to Yi, such that the set of n paths so found is axcdisjoint. For arbitrary graphs the problem is NPcomplete, even for n = 2. We present ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Given a digraph D = (V, A) and a set of n pairs of vertices in V, we axe interested in finding for each pair (xi, Yi), a directed path connecting xi to Yi, such that the set of n paths so found is axcdisjoint. For arbitrary graphs the problem is NPcomplete, even for n = 2. We present
The FF planning system: Fast plan generation through heuristic search
 Journal of Artificial Intelligence Research
, 2001
"... We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be ind ..."
Abstract

Cited by 822 (53 self)
 Add to MetaCart
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts
Planning as Heuristic Search
 Artificial Intelligence
, 2001
"... In the AIPS98 Planning Contest, the hsp planner showed that heuristic search planners can be competitive with state of the art Graphplan and sat planners. Heuristic search planners like hsp transform planning problems into problems of heuristic search by automatically extracting heuristics from S ..."
Abstract

Cited by 423 (34 self)
 Add to MetaCart
Strips encodings. They differ from specialized problem solvers such as those developed for the 24Puzzle and Rubik's cube in that they use a general declarative language for stating problems and a general mechanism for extracting heuristics from these representations. In this paper, we study a
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods
Routing in a delay tolerant network
 Proceedings of ACM Sigcomm
, 2004
"... We formulate the delaytolerant networking routing problem, where messages are to be moved endtoend across a connectivity graph that is timevarying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no con ..."
Abstract

Cited by 612 (8 self)
 Add to MetaCart
We formulate the delaytolerant networking routing problem, where messages are to be moved endtoend across a connectivity graph that is timevarying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
likelihoods, marginal probabilities and most probable configurations. We describe how a wide varietyof algorithms — among them sumproduct, cluster variational methods, expectationpropagation, mean field methods, maxproduct and linear programming relaxation, as well as conic programming relaxations — can
Routing Techniques in Wireless Sensor Networks: A Survey
 IEEE Wireless Communications
, 2004
"... Wireless Sensor Networks (WSNs) consist of small nodes with sensing, computation, and wireless communications capabilities. Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue. The focus, howeve ..."
Abstract

Cited by 704 (2 self)
 Add to MetaCart
, however, has been given to the routing protocols which might differ depending on the application and network architecture. In this paper, we present a survey of the stateoftheart routing techniques in WSNs. We first outline the design challenges for routing protocols in WSNs followed by a comprehensive
Results 1  10
of
69,284