1404 search results - page 130 / 281 » Optimization problems in multiple-interval graphs |
SOFSEM
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
110
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— Most existing work uses dual decomposition and subgradient methods to solve network optimization problems in a distributed manner, which suffer from slow convergence rate prope...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
CGO
2003
IEEE
15 years 1 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...