Sciweavers

364 search results - page 25 / 73
» Shortest-path network interdiction
Sort
View
ICCSA
2004
Springer
14 years 28 days ago
New Parameter for Balancing Two Independent Measures in Routing Path
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
INFORMATICALT
2010
116views more  INFORMATICALT 2010»
13 years 4 months ago
A Dynamic Network Interdiction Problem
We present a novel dynamic network interdiction model that accounts for interactions between an interdictor deploying resources on arcs in a digraph and an evader traversing the ne...
Brian J. Lunday, Hanif D. Sherali
AINA
2008
IEEE
14 years 2 months ago
A Map Matching Algorithm for Car Navigation Systems that Predict User Destination
In this paper, we propose a map matching algorithm for car navigation systems that predict user destination. This car navigation system is a novel system that automatically predict...
Koichi Miyashita, Tsutomu Terada, Shojiro Nishio
IPL
2010
65views more  IPL 2010»
13 years 6 months ago
Multicasting in the hypercube, chord and binomial graphs
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
Christopher C. Cipriano, Teofilo F. Gonzalez
JAIR
2002
106views more  JAIR 2002»
13 years 7 months ago
Collective Intelligence, Data Routing and Braess' Paradox
We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system (MAS) so that they work synergistically to maximize a globa...
David Wolpert, Kagan Tumer