7129 search results - page 268 / 1426 » Approximation Algorithms for Treewidth |
161
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
142
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
139
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the tot...
168
click to vote
AAAI
2000
15 years 5 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
126
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...