Sciweavers

3175 search results - page 133 / 635
» Network properties of folksonomies
Sort
View
TON
1998
77views more  TON 1998»
15 years 6 months ago
Time-shift scheduling - fair scheduling of flows in high-speed networks
—We present a scheduling protocol, called time-shift scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a predet...
Jorge Arturo Cobb, Mohamed G. Gouda, Amal El-Nahas
TIT
1998
112views more  TIT 1998»
15 years 6 months ago
Application of Network Calculus to Guaranteed Service Networks
—We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of resu...
Jean-Yves Le Boudec
ICMCS
2005
IEEE
71views Multimedia» more  ICMCS 2005»
15 years 12 months ago
A proposal of butterfly-graph based stream authentication over lossy networks
In this paper, we propose a butterfly-graph based stream authentication scheme for lossy networks where the streaming packets could be lost in both random and burst ways. Due to t...
Zhishou Zhang, Qibin Sun, Wai-Choong Wong
ROBOCUP
2005
Springer
112views Robotics» more  ROBOCUP 2005»
15 years 12 months ago
Velocity Control of an Omnidirectional RoboCup Player with Recurrent Neural Networks
In this paper, a recurrent neural network is used to develop a dynamic controller for mobile robots. The advantage of the control approach is that no knowledge about the robot mode...
Mohamed Oubbati, Michael Schanz, Thorsten Buchheim...
ICOIN
2004
Springer
15 years 11 months ago
On Generating Random Network Structures: Connected Graphs
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
Alexey S. Rodionov, Hyunseung Choo