Sciweavers

1263 search results - page 51 / 253
» A* with Bounded Costs
Sort
View
JSAC
2006
117views more  JSAC 2006»
14 years 9 months ago
A scalable network resource allocation mechanism with bounded efficiency loss
The design of pricing mechanisms for network resource allocation has two important objectives: 1) a simple and scalable end-to-end implementation and 2) efficiency of the resulting...
Ramesh Johari, John N. Tsitsiklis
ICIP
2007
IEEE
15 years 4 months ago
Adaptive Cluster-Distance Bounding for Nearest Neighbor Search in Image Databases
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
Sharadh Ramaswamy, Kenneth Rose
INFOCOM
2003
IEEE
15 years 3 months ago
Distributed Network Monitoring with Bounded Link Utilization in IP Networks
— Designing optimal measurement infrastructure is a key step for network management. In this work we address the problem of optimizing a scalable distributed polling system. The ...
Erran L. Li, Marina Thottan, Bin Yao, Sanjoy Paul
HEURISTICS
2002
155views more  HEURISTICS 2002»
14 years 9 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
DAM
1999
132views more  DAM 1999»
14 years 9 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian