123 search results - page 24 / 25 » On classes of minimal circular-imperfect graphs |
JMLR
2010
13 years 4 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
SOCIALCOM
2010
13 years 3 months ago
2010
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
SIAMIS
2010
13 years 24 days ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
ESA
2004
Springer
13 years 11 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 ...
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...