9532 search results - page 300 / 1907 » Logic, Graphs, and Algorithms |
174
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
189
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
155
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
178
click to vote
AAAI
1990
15 years 7 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
167
click to vote
IANDC
2000
15 years 6 months ago
2000
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...