806 search results - page 69 / 162 » Lower Bounds on Correction Networks |
183
click to vote
INFORMS
2010
15 years 4 months ago
2010
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
156
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
We investigate in this paper the anchor selection problem with consideration of anchor location uncertainty, which arises naturally from error propagation problem in successive or...
150
click to vote
WEA
2007
Springer
16 years 6 days 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 ...
166
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
187
click to vote
SENSYS
2006
ACM
16 years 1 days ago
2006
ACM
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...