John Franco, Yuan Chuan Ho  Home/Search
Context Related
| uc.edu/~franco/Reports/ucr1.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uc.edu/~franco/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: An algorithm for the Satisfiability problem is presented and its probabilistic behavior is analysed when combined with two other algorithms studied earlier. The analysis is based on an instance distribution which is parameterized to simulate a variety of sample characteristics. The algorithm dynamically assigns values to literals appearing in a given instance until a satisfying assignment is found or the algorithm "gives up" without determining whether or not a solution exists. It is shown that ... (Update)
Context of citations to this paper: More
.... heuristics have been developed to solve the problem[9, 7] and rigorous analysis has been conducted based on well defined random models[2, 1]. The former gives us tools to solve the problem and the latter provides us theoretical background. Most of the current available SAT...
.... when p ln(n) r) The result is similar to a dual result on CNF Boolean instances and a unit clause algorithm that was presented in [3]. However, that result is not strong enough to be applied here. Therefore, in what follows we strengthen the result of [3] and adapt it to...
Cited by: More
Generating Hard Satisfiability Problems - Selman, Mitchell, Levesque (1996) (Correct)
Fair Watermarking Techniques - Qu, Wong, Potkonjak (2000) (Correct)
Optimization-Intensive Watermarking Techniques for Decision.. - Qu, Wong, Potkonjak (1999) (Correct)
Active bibliography (related documents): More All
1.0: On the Probabilistic Performance of Algorithms for the.. - John Franco Department (1986) (Correct)
0.5: Probabilistic Analysis Of A Generalization Of The Unit .. - Satisfiability.. (Correct)
0.4: Probabilistic Analysis Of Two Heuristics For The.. - Ming-Te Chao John (1986) (Correct)
Similar documents based on text: More All
0.4: The Probability of Pure Literals - Rosenthal, Plotkin (Correct)
0.0: Precursors to Number: Making the Most of Continuous Amount - Drake, Mix (2000) (Correct)
0.0: Atomic Supersymmetry, Oscillators, And The Penning Trap - Kostelecky (Correct)
Related documents from co-citation: More All
5: Where the really hard problems are - Cheeseman, Kanefsky et al. - 1991
3: Watermarking techniques for intellectual property protection - Kahng - 1998
3: Ten Challenges in Propositional Reasoning and Search - Selman, Kautz et al. - 1997
BibTeX entry: (Update)
J Franco andY.Ho. Probabilistic performance of a heuristic for the satisfiability problem. Discrete Applied Mathematics, 22:35--51, 1989. http://citeseer.ist.psu.edu/andy86probabilistic.html More
@article{ franco88probabilistic,
author = "Franco and Ho",
title = "Probabilistic Performance of a Heuristic for the Satisfiability Problem",
journal = "DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science",
volume = "22",
year = "1988",
url = "citeseer.ist.psu.edu/andy86probabilistic.html" }
Citations (may not include all citations):459 A computing procedure for quantification theory (context) - Davis, Putnam - 1960
65 Probabilistic analysis of the Davis- Putnam Procedure for so.. (context) - Franco, Paull - 1983
61 Introduction to Queueing Theory (context) - Cooper - 1972
53 Probabilistic analysis of a generalization of the unit claus.. (context) - Chao, Franco - 1985
26 Rinehart and Winston (context) - Purdom, Brown - 1985
23 the complexity of regular resolution and the Davis-Putnam Pr.. (context) - Galil - 1977
18 The pure literal rule and polynomial average time (context) - Purdom, Brown - 1985
14 the probabilistic performance of algorithms for the satisfia.. - Franco - 1986
13 Probabilistic analysis of two heuristics for the 3satisfiabi.. (context) - Chao, Franco - 1986
9 Probabilistic analysis of the pure literal heuristic for the.. (context) - Franco - 1984
4 Probabilistic Analysis and Performance Measurement of Algori.. (context) - Chao - 1985
3 Average time analyses of simplified Davis-Putnam Procedures (context) - Goldberg, Purdom et al. - 1982
2 Search rearrangement bactracking and polynomial average time (context) - Purdom - 1983
1 the expected number of branches in analytic tableaux analysi.. (context) - Plotkin, Rosenthal - 1978
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ececs.uc.edu/~franco/): More
The Analysis of Hashing with Lazy Deletions - Celis, Franco (1995) (Correct)
Probabilistic Analysis Of Two Heuristics For The.. - Ming-Te Chao John (1986) (Correct)
Work-Preserving Emulations of Shuffle-Exchange Networks.. - Fred Annexstein John (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC