Sciweavers

2266 search results - page 27 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
IJCAI
2003
15 years 1 months ago
Backbone Guided Local Search for Maximum Satisfiability
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...
Weixiong Zhang, Ananda Rangan, Moshe Looks
IPL
2008
95views more  IPL 2008»
14 years 11 months ago
Approximating maximum satisfiable subsystems of linear equations of bounded width
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
Zeev Nutov, Daniel Reichman
JAL
2000
82views more  JAL 2000»
14 years 11 months ago
New Upper Bounds for Maximum Satisfiability
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses....
Rolf Niedermeier, Peter Rossmanith
AUSAI
2007
Springer
15 years 3 months ago
Branching Rules for Satisfiability Analysed with Factor Analysis
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
Richard J. Wallace, Stuart Bain
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
15 years 5 months ago
Hybridizing evolutionary algorithms and clustering algorithms to find source-code clones
This paper presents a hybrid approach to detect source-code clones that combines evolutionary algorithms and clustering. A case-study is conducted on a small C++ code base. The pr...
Andrew Sutton, Huzefa H. Kagdi, Jonathan I. Maleti...