4781 search results - page 149 / 957 » Online algorithms for network design |
157
click to vote
INFOCOM
1992
IEEE
15 years 10 months ago
1992
IEEE
This paper describes a methodology for designing interconnected LAN-MAN networks with the objective of minimizing the average network delay. We consider IEEE 802.3-5 LANs intercon...
167
click to vote
ARCS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Dynamic hardware reconfiguration is becoming a key technology in embedded system design that offers among others new potentials in dependable computing. To make system de...
179
click to vote
SIGIR
2011
ACM
14 years 9 months ago
2011
ACM
We study a novel problem of social context summarization for Web documents. Traditional summarization research has focused on extracting informative sentences from standard docume...
172
click to vote
DISOPT
2008
15 years 6 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
287
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Location-based services and data mining algorithms analyzing objects moving on a complex traffic network are becoming increasingly important. In this paper, we introduce a new app...