Sciweavers

2421 search results - page 188 / 485
» Approximate Flow-Aware Networking
Sort
View
100
Voted
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
15 years 10 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
INFOCOM
2008
IEEE
15 years 10 months ago
Maximizing Restorable Throughput in MPLS Networks
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
Reuven Cohen, Gabi Nakibly
135
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
Scott C.-H. Huang, Peng-Jun Wan, Xiaohua Jia, Hong...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 5 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
NIPS
2004
15 years 5 months ago
Hierarchical Bayesian Inference in Networks of Spiking Neurons
There is growing evidence from psychophysical and neurophysiological studies that the brain utilizes Bayesian principles for inference and decision making. An important open quest...
Rajesh P. N. Rao