233 search results - page 16 / 47 » Flows on Few Paths: Algorithms and Lower Bounds |
TIT
1998
13 years 7 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
NETWORKS
2010
13 years 6 months ago
2010
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
WCET
2010
13 years 5 months ago
2010
Calculating the worst-case execution time (WCET) of real-time tasks is still a tedious job. Programmers are required to provide additional information on the program flow, analyzi...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
—Distributed detection of information flows spanning many nodes in a wireless sensor network is considered. In such a system, eavesdroppers are deployed near several nodes in th...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...