1480 search results - page 99 / 296 » Distributed algorithms for weighted problems in sparse graph... |
90
Voted
ESA
2004
Springer
15 years 6 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
121
Voted
PPOPP
2012
ACM
13 years 8 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
135
Voted
AAMAS
2011
Springer
14 years 7 months ago
2011
Springer
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...
103
Voted
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
Creating coordinated multiagent policies in environments with uncertainty is a challenging problem, which can be greatly simplified if the coordination needs are known to be limi...
AAAI
1994
15 years 1 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...