Sciweavers

1502 search results - page 133 / 301
» Node weighted scheduling
Sort
View
COCOON
2009
Springer
16 years 27 days ago
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
Enoch Peserico, Luca Pretto
IJCNN
2006
IEEE
16 years 10 days ago
Learning using Dynamical Regime Identification and Synchronization
—This study proposes to generalize Hebbian learning by identifying and synchronizing the dynamical regimes of individual nodes in a recurrent network. The connection weights are ...
Nicolas Brodu
MOBICOM
2004
ACM
15 years 11 months ago
Routing in multi-radio, multi-hop wireless mesh networks
We present a new protocol for routing in multi-radio, multi-hop wireless networks. Our protocol, Multi-Radio Link-Quality Source Routing, is designed for wireless networks with st...
Richard Draves, Jitendra Padhye, Brian Zill
CP
2005
Springer
15 years 12 months ago
Dimensioning an Inbound Call Center Using Constraint Programming
One of the critical problems in the call center industries is the staffing problem since they must face variable demands and because staff costs represent a major part of the cost...
Cyril Canon, Jean-Charles Billaut, Jean-Louis Bouq...
INFOCOM
2003
IEEE
15 years 11 months ago
Exploiting Wireless Channel State Information for Throughput Maximization
— We consider the problem of scheduling packets over a number of channels with time varying connectivity. Policies proposed for this problem either stabilize the system when the ...
Vagelis Tsibonis, Leonidas Georgiadis, Leandros Ta...