Sciweavers

13214 search results - page 220 / 2643
» Pseudorandomness for network algorithms
Sort
View
EURONGI
2005
Springer
16 years 4 days ago
A Low Computation Cost Algorithm to Solve Cellular Systems with Retrials Accurately
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
Maria José Doménech-Benlloch, Jos&ea...
ICN
2005
Springer
16 years 3 days ago
Performance Improvement of Hardware-Based Packet Classification Algorithm
Yaw-Chung Chen, Pi-Chung Wang, Chun-Liang Lee, Chi...
SOFSEM
2010
Springer
16 years 3 months ago
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. ...