Sciweavers

2252 search results - page 368 / 451
» Improving Random Forests
Sort
View
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 9 months ago
Network Codes Resilient to Jamming and Eavesdropping
Abstract--We consider the problem of communicating information over a network secretly and reliably in the presence of a hidden adversary who can eavesdrop and inject malicious err...
Hongyi Yao, Danilo Silva, Sidharth Jaggi, Michael ...
COR
2008
111views more  COR 2008»
13 years 9 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 9 months ago
Dynamic Vehicle Routing for Data Gathering in Wireless Networks
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
Güner D. Çelik, Eytan Modiano
CORR
2006
Springer
145views Education» more  CORR 2006»
13 years 9 months ago
MIMO Broadcast Channels with Block Diagonalization and Finite Rate Feedback
Block diagonalization is a linear precoding technique for the multiple antenna broadcast (downlink) channel that involves transmission of multiple data streams to each receiver su...
Niranjay Ravindran, Nihar Jindal
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 9 months ago
Scheduling and Codeword Length Optimization in Time Varying Wireless Networks
Abstract-- In this paper, a downlink scenario in which a singleantenna base station communicates with K single antenna users, over a time-correlated fading channel, is considered. ...
Mehdi Ansari Sadrabadi, Alireza Bayesteh, Amir K. ...