Sciweavers

13214 search results - page 166 / 2643
» Pseudorandomness for network algorithms
Sort
View
VALUETOOLS
2006
ACM
156views Hardware» more  VALUETOOLS 2006»
16 years 14 days ago
TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks
— We introduce a new congestion control algorithm for high speed networks, called TCP-Illinois. TCP-Illinois uses packet loss information to determine whether the window size sho...
Shao Liu, Tamer Basar, R. Srikant
CIC
2006
102views Communications» more  CIC 2006»
15 years 8 months ago
On-line Algorithm for Server Selection of Video Streaming over P2P Networks
We consider a video streaming application over P2P networks and introduce the P2P on-line server selection problem. This task is related to the classic K-server problem, known fro...
Hao Wang, Andras Farago
IJIT
2004
15 years 8 months ago
A Comparison of First and Second Order Training Algorithms for Artificial Neural Networks
Minimization methods for training feed-forward networks with Backpropagation are compared. Feedforward network training is a special case of functional minimization, where no expli...
Syed Muhammad Aqil Burney, Tahseen Ahmed Jilani, C...
ICUMT
2009
15 years 4 months ago
Coverage and adaptive scheduling algorithms for criticality management on video wireless sensor networks
In WSN-based surveillance systems power conservation is an important issue but one must also ensure that the application's objectives are met. In this paper, we jointly addres...
Abdallah Makhoul, Rachid Saadi, CongDuc Pham
SOFSEM
2007
Springer
16 years 19 days ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
Markus Maier, Steffen Mecke, Dorothea Wagner