13214 search results - page 337 / 2643 » Pseudorandomness for network algorithms |
160
click to vote
AAAI
2008
15 years 9 months ago
2008
We explore the relationship between properties of the network defined by connected agents and the global system performance. This is achieved by means of a novel class of optimiza...
150
click to vote
COMCOM
2002
15 years 6 months ago
2002
Multicast routing algorithms that are capable of providing quality of service (QoS) to its members will play an important role in future communication networks. This paper discuss...
180
click to vote
WINE
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
159
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
150
click to vote
INFOCOM
2006
IEEE
16 years 24 days ago
2006
IEEE
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...