4403 search results - page 212 / 881 » Galois Theory of Algorithms |
169
click to vote
ICDT
2010
ACM
15 years 5 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
181
click to vote
WWW
2007
ACM
16 years 7 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...
190
click to vote
FOCS
2009
IEEE
16 years 1 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...
182
click to vote
ATAL
2009
Springer
16 years 1 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...
146
click to vote
ATAL
2007
Springer
16 years 23 days 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...