4372 search results - page 210 / 875 » Algorithmic Theories of Everything |
109
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
Web-based communities have become important places for people to seek and share expertise. We find that networks in these communities typically differ in their topology from other...
121
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
101
click to vote
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we address the problem of decentralised coordination for agents that must make coordinated decisions over continuously valued control parameters (as is required in m...
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we discuss the use of Targeted Trajectory Distribution Markov Decision Processes (TTD-MDPs)—a variant of MDPs in which the goal is to realize a specified distrib...
107
Voted
ESA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...