Sciweavers

298 search results - page 10 / 60
» Multicriteria Steiner Tree Problem for Communication Network
Sort
View
84
Voted
IS
2010
14 years 6 months ago
Multicriteria reinforcement learning based on a Russian doll method for network routing
The routing in communication networks is typically a multicriteria decision making (MCDM) problem. However, setting the parameters of most used MCDM methods to fit the preferences ...
Alain Pétrowski, Farouk Aissanou, Ilham Ben...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
15 years 9 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 4 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
82
Voted
TPDS
2008
136views more  TPDS 2008»
14 years 9 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
ICC
2007
IEEE
155views Communications» more  ICC 2007»
15 years 3 months ago
On Supporting Robust Voice Multicasting Over Ad Hoc Wireless Networks
Abstract— In this paper, we address the problem of voice multicasting in ad hoc wireless networks. The unique characteristics of voice traffic (viz. small packet size, high pack...
G. Venkat Raju, Tamma Bheemarjuna Reddy, C. Siva R...