Sciweavers

1263 search results - page 170 / 253
» A* with Bounded Costs
Sort
View
COMCOM
2007
99views more  COMCOM 2007»
13 years 9 months ago
Topology-aware overlay path probing
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as O(n2 ), which is prohibitive in large-scale...
Chiping Tang, Philip K. McKinley
EOR
2007
80views more  EOR 2007»
13 years 9 months ago
A partition approach to the inventory/routing problem
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...
Qiu-Hong Zhao, Shouyang Wang, Kin Keung Lai
PAMI
2006
164views more  PAMI 2006»
13 years 9 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
TIT
2008
127views more  TIT 2008»
13 years 9 months ago
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
Mohsen Bayati, Devavrat Shah, Mayank Sharma
TSP
2008
126views more  TSP 2008»
13 years 9 months ago
HOS-Based Semi-Blind Spatial Equalization for MIMO Rayleigh Fading Channels
In this paper we concentrate on the direct semi-blind spatial equalizer design for MIMO systems with Rayleigh fading channels. Our aim is to develop an algorithm which can outperf...
Zhiguo Ding, Tharmalingam Ratnarajah, Colin Cowan