Results 1  10
of
1,501,308
Parallel WalkSAT with Clause Learning
"... We present an extension of WalkSAT, a stochastic local search algorithm for solving SAT problems. Our extension learns new clauses by resolving existing clauses based on the current state of a WalkSAT run. We show that clause learning leads to significant speedup in WalkSAT runs, both in terms of fe ..."
Abstract
 Add to MetaCart
We present an extension of WalkSAT, a stochastic local search algorithm for solving SAT problems. Our extension learns new clauses by resolving existing clauses based on the current state of a WalkSAT run. We show that clause learning leads to significant speedup in WalkSAT runs, both in terms
Walksat in the 2004 SAT Competition
"... The first convincing demonstration that local search could be used to solve challenging satisfiability problems was provided by the GSAT algorithm [9]. GSAT performs gradient descent search in the space of complete truth assignments, where adjacent assignments differ on a single variable and the obj ..."
Abstract
 Add to MetaCart
are chosen randomly from the clause and the clause length is bounded by a constant k it is easy to see that each flip as a 1/k or better chance of being correct. When k = 2 a pure random walk strategy will solve a satisfiable formula over n variables with high probability in O(n 2) time [5]. For larger
A Theoretical Analysis of the kSatisfiability Search Space ⋆
"... Abstract. Local search algorithms perform surprisingly well on the ksatisfiability (kSAT) problem. However, few theoretical analyses of the kSAT search space exist. In this paper we study the search space of the kSAT problem and show that it can be analyzed by a decomposition. In particular, we ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Local search algorithms perform surprisingly well on the ksatisfiability (kSAT) problem. However, few theoretical analyses of the kSAT search space exist. In this paper we study the search space of the kSAT problem and show that it can be analyzed by a decomposition. In particular, we
Using WalkSAT and RelSAT for cryptographic key search
 In Proceedings of the International Joint Conference on Arti Intelligence
, 1999
"... Computer security depends heavily on the strength of cryptographic algorithms. Thus, cryptographic key search is often THE search problem for many governments and corporations. In the recent years, Al search techniques have achieved notable successes in solving "real world" problem ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
algorithms optimally share the features of "real world " and random problems. In this paper, two stateoftheart Al search algorithms, WalkSAT by Kautz & Selman and RelSAT by Bayardo & Schrag, have been tested on the encoding of the Data Encryption Standard, to see whether
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
Inducing Features of Random Fields
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1997
"... We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing the ..."
Abstract

Cited by 664 (14 self)
 Add to MetaCart
We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
Partial Satisfaction of kSatisfiable Formulas
"... Abstract. A CNF formula is called ksatisfiable, if every subformula containing at most k clauses is satisfiable. What is the largest ratio r such that for any ksatisfiable formula F, there is an assignment satisfying at least a fraction r of F? This question can be asked for formulas with weighted ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. A CNF formula is called ksatisfiable, if every subformula containing at most k clauses is satisfiable. What is the largest ratio r such that for any ksatisfiable formula F, there is an assignment satisfying at least a fraction r of F? This question can be asked for formulas with weighted
DART: Directed automated random testing
 In Programming Language Design and Implementation (PLDI
, 2005
"... We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external environment using static sourcecode parsing; (2) automatic generation of a test driver for this interface that performs ..."
Abstract

Cited by 823 (41 self)
 Add to MetaCart
that performs random testing to simulate the most general environment the program can operate in; and (3) dynamic analysis of how the program behaves under random testing and automatic generation of new test inputs to direct systematically the execution along alternative program paths. Together, these three
Results 1  10
of
1,501,308