2430 search results - page 301 / 486 » Computing Tutte Polynomials |
111
click to vote
CP
2008
Springer
15 years 5 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
143
click to vote
ECAI
2008
Springer
15 years 5 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 ...
142
click to vote
EUROCRYPT
2008
Springer
15 years 5 months ago
2008
Springer
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...
126
Voted
CCCG
2010
15 years 5 months ago
2010
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q...
124
click to vote
ICAI
2007
15 years 5 months ago
2007
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...