1008 search results - page 109 / 202 » Motivations for social networking at work |
135
click to vote
CIKM
2010
Springer
15 years 9 days ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
116
Voted
AHSWN
2010
15 years 1 months ago
2010
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
147
click to vote
NCA
2009
IEEE
15 years 8 months ago
2009
IEEE
—A transport layer protocol supporting multihoming allows an application to transmit data via multiple paths simultaneously (termed concurrent multipath transfer, or CMT for shor...
120
Voted
BIOWIRE
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we explore some of the connections between cooperative game theory and the utility maximization framework for routing and flow control in networks. Central to both a...
110
click to vote
ACMICEC
2008
ACM
15 years 3 months ago
2008
ACM
Prior theory and empirical work emphasize the enormous free-riding problem facing peer-to-peer (P2P) sharing networks. Nonetheless, many P2P networks thrive. We explore two possib...