Sciweavers

511 search results - page 81 / 103
» TSP with bounded metrics
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Network Routing Topology Inference from End-to-End Measurements
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...
Jian Ni, Haiyong Xie 0002, Sekhar Tatikonda, Yang ...
WCNC
2008
IEEE
14 years 2 months ago
An Opportunistic Scheduling Scheme with Minimum Data-Rate Guarantees for OFDMA
Abstract—We tackle the problem of providing minimum datarate guarantees for different classes-of-service in an OFDMAbased network, while obtaining a high system throughput. Our a...
Razvan Pitic, Antonio Capone
IROS
2007
IEEE
145views Robotics» more  IROS 2007»
14 years 2 months ago
A quantitative method for comparing trajectories of mobile robots using point distribution models
— In the field of mobile robotics, trajectory details are seldom taken into account to qualify robot performance. Most metrics rely mainly on global results such as the total ti...
Pierre Roduit, Alcherio Martinoli, Jacques Jacot
ESA
2007
Springer
92views Algorithms» more  ESA 2007»
14 years 2 months ago
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
Abstract. The small world phenomenon, a.k.a. the six degree of separation between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram experiment demonstr...
Pierre Fraigniaud
FOCS
2006
IEEE
14 years 2 months ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...