Sciweavers

1022 search results - page 122 / 205
» New models and algorithms for programmable networks
Sort
View
88
Voted
4OR
2005
104views more  4OR 2005»
15 years 16 days ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
TVCG
2008
119views more  TVCG 2008»
15 years 15 days ago
Exploration of Networks using overview+detail with Constraint-based cooperative layout
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
Tim Dwyer, Kim Marriott, Falk Schreiber, Peter J. ...
WMASH
2004
ACM
15 years 6 months ago
LOCATOR: location estimation system For wireless LANs
With the wide spread growth of mobile computing devices and local area wireless networks, wireless network providers have started to target the users with value-added services bas...
Ankur Agiwal, Parakram Khandpur, Huzur Saran
108
Voted
ICMCS
2005
IEEE
106views Multimedia» more  ICMCS 2005»
15 years 6 months ago
Media Aware Routing in Large Scale Networks with Overlay
This paper presents a new routing strategy, that selects the best network paths in an overlay network, in order to minimize the distortion perceived by the end user. We first pro...
Dan Jurca, Sanja Petrovic, Pascal Frossard
130
Voted
DMSN
2006
ACM
15 years 6 months ago
Impact of multi-query optimization in sensor networks
In this paper, we study the problem of processing multiple queries in a wireless sensor network. We focus on multiquery optimization at the base station level to minimize the numb...
Shili Xiang, Hock-Beng Lim, Kian-Lee Tan