Sciweavers

269 search results - page 44 / 54
» Cooperative Strategies and Optimal Scheduling for Tree Netwo...
Sort
View
IPPS
2000
IEEE
14 years 3 days ago
A Parallel Co-evolutionary Metaheuristic
In order to show that the parallel co-evolution of di erent heuristic methods may lead to an e cient search strategy, we have hybridized three heuristic agents of complementary beh...
Vincent Bachelet, El-Ghazali Talbi
INFOCOM
2003
IEEE
14 years 1 months ago
MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched data (PSD) in the UMTS Terrestrial Radio Access Net...
Michael Menth, Matthias Schmid, Herbert Heiss, Tho...
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 2 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
CCR
2004
120views more  CCR 2004»
13 years 7 months ago
MAC-layer anycasting in ad hoc networks
A wireless ad hoc network is formed by a group of wireless hosts, without the use of any infrastructure. To enable communication, hosts cooperate among themselves to forward packet...
Romit Roy Choudhury, Nitin H. Vaidya
SIGMOD
2005
ACM
126views Database» more  SIGMOD 2005»
14 years 7 months ago
Cost-Sensitive Reordering of Navigational Primitives
We present a method to evaluate path queries based on the novel concept of partial path instances. Our method (1) maximizes performance by means of sequential scans or asynchronou...
Carl-Christian Kanne, Matthias Brantner, Guido Moe...