2766 search results - page 266 / 554 » Algorithms for trigonometric polynomials |
169
click to vote
ECAI
2008
Springer
15 years 7 months ago
2008
Springer
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
144
click to vote
ECAI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Algorithms for probabilistic inference in Bayesian networks are known to have running times that are worst-case exponential in the size of the network. For networks with ...
136
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
150
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
143
Voted
JDA
2007
15 years 5 months ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...