23988 search results - page 600 / 4798 » Social Network Computing |
357
click to vote
Publication
Congestion avoidance mechanisms allow a network to operate in the optimal region of low delay and high throughput, thereby, preventing the network from becoming congested. This is ...
155
click to vote
JSAC
2006
15 years 7 months ago
2006
We study the flow control and routing decisions of self-interested users in a general congested network where a single profit-maximizing service provider sets prices for different ...
185
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
185
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
We discuss the Innovation Jam that IBM carried out in 2006, with the objective of identifying innovative and promising "Big Ideas" through a moderated on-line discussion...
152
click to vote
ALT
2009
Springer
16 years 4 months ago
2009
Springer
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...