Sciweavers

625 search results - page 61 / 125
» Semi-preemptive routing on trees
Sort
View
109
Voted
ICPADS
2008
IEEE
15 years 7 months ago
Response Time Constrained Top-k Query Evaluation in Sensor Networks
Existing solutions for top-k queries in wireless sensor networks mainly focused on energy efficiency and little attention has been paid to the response time to answer a top-k que...
Weifa Liang, Baichen Chen, Jeffrey Xu Yu
103
Voted
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
15 years 6 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
105
Voted
ICCCN
2008
IEEE
15 years 7 months ago
Inter-Domain Routing Scalability in Optical DWDM Networks
: Recent studies on inter-domain DWDM networks used on topology abstraction for state summarization, i.e., transforming a physical topology to a virtual mesh, tree, or star network...
Qing Liu, Chongyang Xie, Tannous Frangieh, Nasir G...
89
Voted
IPPS
2006
IEEE
15 years 6 months ago
An integrated approach for density control and routing in wireless sensor networks
Wireless Sensor Networks (WSNs) are characterized by having scarce resources. The usual way of designing network functions is to consider them isolatedly, a strategy which may not...
Isabela G. Siqueira, Carlos Mauricio S. Figueiredo...
111
Voted
WOWMOM
2005
ACM
138views Multimedia» more  WOWMOM 2005»
15 years 6 months ago
A Scenario-Based Performance Evaluation of Multicast Routing Protocols for Ad Hoc Networks
Current ad hoc multicast routing protocols have been designed to build and maintain a tree or mesh in the face of a mobile environment, with fast reaction to network changes in or...
Manoj Pandey, Daniel Zappala