390 search results - page 72 / 78 » Computing shortest paths for any number of hops |
125
Voted
TAMC
2009
Springer
15 years 8 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
126
click to vote
TCSV
2008
15 years 1 months ago
2008
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
147
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
111
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
133
click to vote
WIMOB
2009
IEEE
15 years 8 months ago
2009
IEEE
—Routing in ad hoc networks is a well known issue. Most of the previous propositions to route data between two nodes aimed to define a path (sometimes several ones) on which pac...