Sciweavers

5056 search results - page 361 / 1012
» Network Coding Theory
Sort
View
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 6 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
SAGT
2010
Springer
151views Game Theory» more  SAGT 2010»
15 years 2 months ago
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users
Abstract. We consider network congestion games in which a finite number of non-cooperative users select paths. The aim is to mitigate the inefficiency caused by the selfish users...
Dimitris Fotakis, George Karakostas, Stavros G. Ko...
KDD
2009
ACM
216views Data Mining» more  KDD 2009»
16 years 5 months ago
Finding a team of experts in social networks
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
Theodoros Lappas, Kun Liu, Evimaria Terzi
CIKM
2009
Springer
15 years 11 months ago
Role of weak ties in link prediction of complex networks
Plenty of algorithms for link prediction have been proposed and were applied to various real networks. Among these works, the weights of links are rarely taken into account. In th...
Linyuan Lu, Tao Zhou
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 8 months ago
The baldwin effect in developing neural networks
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...
Keith L. Downing