530 search results - page 14 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
SIAMJO
2010
13 years 2 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
JALC
2002
13 years 7 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...