Statistical Analysis of Backtracking on. Inconsistent CSPs? Irina Rish and Daniel Frost.
|
|
- August Reeves
- 5 years ago
- Views:
Transcription
1 Statistical Analysis of Backtracking on Inconsistent CSPs Irina Rish and Daniel Frost Department of Information and Computer Science University of California, Irvine, CA Abstract. We analyze the distribution of computational eort required by backtracking algorithms on unsatisable CSPs, using analogies with reliability models, where lifetime of a specimen before failure corresponds to the runtime of backtracking on unsatisable CSPs. We extend the results of [7] by showing empirically that the lognormal distribution is a good approximation of the backtracking eort on unsolvable CSPs not only at the 50% satisable point, but in a relatively wide region. We also show how the law of proportionate eect [9] commonly used to derive the lognormal distribution can be applied to modeling the number of nodes expanded in a search tree. Moreover, for certain intervals of C=N, where N is the number of variables, and C is the number of constraints, the parameters of the corresponding lognormal distribution can be approximated by the linear lognormal model [11] where mean log(deadends) is linear in C=N, and variance of log(deadends) is close to constant. The linear lognormal model allows us to extrapolate the results from a relatively easy overconstrained region to the hard critically constrained region and, in particular, to use more ecient strategies for testing backtracking algorithms. 1 Introduction All models are wrong, but some are useful. George E.P. Box Empirical evidence presented in [7] demonstrates that the distribution of eort required to solve CSPs randomly generated at the 50% satisable point, when using a backtracking algorithm, can be approximated by two standard families of continuous probability distribution functions. Solvable problems can be approximated by the Weibull distribution and unsolvable problems by the lognormal distribution. Both distribution are widely used in reliability theory for modeling the lifetime of a product. An analogy between a product's lifetime and an algorithm's runtime suggests reliability models may be applicable to the statistical analysis of algorithms. This work was partially supported by NSF grant IRI , Air Force Oce of Scientic Research grant AFOSR , Rockwell Micro grant 22147, and UC Micro grant
2 In this paper we focus on unsatisable problems, extending the results of [7] to a wider range of parameters (not just the 50% point) and studying how the parameters of the distribution depend on the parameters of a problem generator. We show empirical results for the Davis-Putnam Procedure augmented with the heuristic proposed in [1] on random 3SAT problems, and for the algorithm BJ+DVO [6] on random binary CSPs. Our results on a variety of CSP problems and dierent backtracking algorithms suggest that the lognormal distribution captures some inherent properties of backtracking search on unsatisable CSPs. The lognormal distribution can be derived from the law of proportionate eect [2] which is used to model certain natural processes, such as failure of a material due to the growing size of fatigue cracks. We observed at certain regions of C=N ratio, including a relatively wide region around the transition point, that the performance of backtracking ts the linear lognormal model [11]. This model allows us to compute the parameters of the lognormal distribution in a relatively easy overconstrained region (say, for C=N around 6 for 3SAT) and extrapolate the results to the transition region. Clearly, studies of articial random problems are limited since they do not reect real applications. However, random problems are useful for systematic analysis of algorithms. Also, some real applications can be studied statistically and may accommodate a similar analysis to the one we propose here. One example is scheduling problems (e.g., airline scheduling) which has to take into account daily changes within the same system. Another example is the performance analysis of inference in a knowledge base on a variety of queries. In the next section, we describe the random problem generators and the algorithms we experimented with. Section 3 gives some statistical background. The law of proportionate eect and its applicability to backtracking search are discussed in section 4. Section 5 presents empirical study and the models we propose. In section 6, we give a summary of our results, discuss their practical importance, and outline some directions for further research. 2 Problems and Algorithms The binary CSP experiments reported in this paper were run on a model of uniform random binary constraint satisfaction problems that takes four parameters: N; D; T and C. The problem instances are binary CSPs with N variables, each having a domain of size D. The parameter T (tightness) species the probability that a value pair in a constraint is disallowed. The parameter C species the probability of a binary constraint existing between two variables. We also experimented with random 3SAT problems which can be viewed as a type of CSP with ternary constraints and D = 2. The random 3SAT problem generator was implemented as proposed in [10] for k = 3. It takes as an input the number of variables N, the number of literals per clause, k, and the number of clauses C, and generates each clause by choosing k variables randomly and ipping the sign of each literal with probability p = 0.5.
3 For binary CSPs, we present results using algorithm BJ+DVO [6], which combines backjumping, forward checking style domain ltering, and a dynamic variable ordering scheme. On 3SAT, we experimented with another backtracking algorithm, the Davis-Putnam Procedure (DPP) [4] augmented with the heuristics proposed in [1]. We measure the hardness of a problem by counting the total number of deadends, including \internal" (non-leaf) deadends. On unsatisable problems, this number just coincides with the number of nodes explored in the search tree. 3 Statistical Background The two-parameter lognormal distribution is based on the well-known normal or Gaussian distribution. If the logarithm of a random variable is normally distributed, then the random variable itself shows a lognormal distribution. The density function, with scale parameter and shape parameter, is f(t) = ( 1 p 2t exp (log t) ; t > 0 0; t 0 and the cumulative lognormal distribution function is F (t) = log t where () is the standard normal cumulative distribution function. The mean value of the lognormal distribution is E = exp( + 2 =2). Simple formulas for the median and mode are given by exp() and exp( 2 ), respectively. Note that for a lognormally distributed variable t, log median equals mean log(t). Given a population sample x 1 ; :::; x n and a parameterized probability distribution family, there are several methods for estimating the parameters that best match the data. We used maximum likelihood estimators (MLE)[3]: = mean log(deadends), = square root of the variance of log(deadends) (correcting a misstatement in [7], the MLE for the lognormal distribution is completely satisfactory). 4 The Proportionate Eect Model One of the oldest and most widely used methods for deriving the lognormal distribution is the law of proportionate eect [2]. This law states that if the growth rate of a variable at each step in a process is in random proportion to its size at that step, then the size of the variable at time n will be approximately lognormally distributed. In other words, if the value of a random variable at time i is X i, and the relationship ; X i = X i1 b i
4 holds, where (b 1 ; b 2 ; : : :; b n ) are positive independent random variables, then the distribution of X i is, for large enough i, lognormally distributed. The law of proportionate eect follows from the central limit theorem, since log(x n ) = nx i log(b i ) and the sum of independent random variables log(b i ) converges to the normal distribution. In the context of constraint satisfaction problems, we will now show that the number of nodes on level i of the search tree explored by backtracking is distributed lognormally when i is suciently large. We restrict our attention to the simple backtracking algorithm with a xed variable ordering (Y 1 ; :::; Y N ) and to the inconsistent random binary CSPs with the parameters hn; D; T; Ci (inconsistency implies that the entire search tree needs to be explored). Let X i be the number of nodes on search tree level i; 1 i N. The branching factor b i at each level is dened as X i =X i1 for 2 i N, and b 1 = D. For i > 1, b i is randomly distributed in [0; D] and species how many values of variable Y i1 are consistent with the previous assignment. The probability of a value k for Y i1 being consistent with the assignment to Y 1 ; :::; Y i2 is p i = (1 CT ) i2 ; where C is the probability of a constraint between Y i1 and a previous variable. T is the probability of a value pair to be prohibited by that constraint. Then the branching factor b i is distributed binomially with parameter p i. On each level i, b i is independent of previous b's. Note that b i are non-negative (positive for all levels except the deepest level in the tree reached by backtracking) and can be greater than or less than 1 (since b i can be zero, the low of proportionate eect is not entirely applicable for some deep levels of the search tree). Then X i = b 1 b 2 : : : b i ; is lognormally distributed by the law of proportionate eect. This derivation applies to the distribution of nodes on each particular level i, where i is large enough. It still remains to be shown how this analysis relates to the distribution of the total number of P nodes explored in a tree. In a complete N search tree, the total number of nodes i=0 Di = (D N+1 1)=(D1) D N D D1 is proportional to the number of nodes at the deepest level, D N. A similar relation may be possible to derive for a backtracking search tree. Satisable CSPs do not t this scheme since the tree traversal is interrupted when solution is found. As mentioned above, empirical results also point to substantial dierence in behavior of satisable and unsatisable problems.
5 5 Empirical Results We experimented with the DPP and BJ+DVO algorithms described above, running 10,000 experiments per each combination of parameters (in the underconstrained region we had to ran up to 100,000 experiments in order to nd a satisfactory amount of unsatisable problems). For each instance we recorded whether a solution was found and the number of deadends (including internal deadends, as mentioned above). Experiments on 3SAT with 100, 125, 175 and 200 variables and C=N 2 [3; 10], and on binary CSPs with 75, 100 and 150 variables and various values of D, T and C, demonstrate a good t of the lognormal distribution to the empirical data for unsolvable problems. Figure 1 shows histograms (vertical bars) and continuous lognormal distributions (curved lines) for selected experiments, using the algorithms DPP on 3SAT with N = 175 and several values of C=N (on the left) and BJ+DVO on binary CSPs with N = 100, D = 8, T = 0:5 and several values of C (on the right). The x-axis unit is deadends. Vertical dotted lines indicate median of data, while ^ indicates mean. The data has been grouped in 100 intervals of equal length summarized by each vertical bar. Data greater than the maximum number of nodes indicated on the x-axis has been truncated from the charts. The y-axis shows the fraction of the sample that is expected (for the distribution functions) or was found to occur (for the experimental data) within each range. The \count" means the number of instances for each set of parameters. We can see that the lognormal distribution with MLE parameters captures the wide variety of shapes in the empirical distributions. We examined several distributions, such as the normal, lognormal, gamma, Weibull, and inverse Gaussian distributions, which all have an exponential tail and which all have similar curves in certain parameter ranges. When is small (e.g. less than 0.5) the lognormal distribution looks quite similar to the normal distribution. Also, for small, the gamma distribution can sometimes provide a slightly better t (see Figure 2(a)). When the data is strongly skewed, e.g. > 1, the lognormal distribution typically models the data better than the gamma (see Figure 2 (b)). Assuming the lognormal distribution of the unsatisable problems, we would like to know how the parameters and depend on the parameters of the problem and on heuristic employed by the specic backtracking algorithm. Figure 3(a) shows how and depend on the C=N ratio for unsatisable 3SAT problems. Similar data but for both satisable and unsatisable binary CSPs are shown in Figure 4(b). It is striking that on 3SAT problems is practically constant on a wide range of C=N for dierent N (a closer look at reveals a very slow growth in the transition region). The growth of in transition region is more pronounced in binary CSPs (Figure 4(b)).
6 count = 1,995 C/N = % solvable = 9:57 = 0:38.04 C = % solvable = 11:44; = 1:60 count = ,000 5,000,000 C/N = % solvable = 9:19 = 0:38 count = 8, C = % solvable = 10:40; = 1:74 count = 4, K at 10 scale 0 10,000 30, ,000 C/N = 5.0 0% solvable = 7:63 = 0:33 count = 12, C = % solvable = 9:30; = 1:68 count = 9,674 5, ,000 C/N = % solvable = 3:84 = 0:22 count = 100K C = % solvable = 5:41 = 0:63 count = 10, (a) 500 (b) Fig. 1. Lognormal t to empirical distributions for DPP on 3SAT (a) and BJ+DVO on binary CSPs (b).
7 lognormal C/N = % solvable = 3:84 = 0:22 count = 100K gamma C/N = % solvable = 20:7 count = 100K (a).05 C = % solvable = 10:40; = 1:74 count = 4,791 lognormal.05 C = % solvable = 0:45 count = 4,791 gamma , ,000 (b) Fig. 2. Comparison of lognormal and gamma distribution functions on two samples of data from Figure 1. is the shape parameter of the gamma distribution. Typically, the gamma distribution is as good a t or better than lognormal when the shape is fairly symmetrical (which happens for small, such as = 0:22 in the rst row). But the lognormal provides a substantially better t for skewed and long-tailed distributions of data with larger, as in the second row ( = 1:74).
8 variables 125 variables 150 variables 175 var 200 variables (a) variables 125 variables 150 variables 175 var 200 variables (b) Fig. 3. Parameters and as functions of C=N in a wide region (a) and near the transition (b)
9 , satisable, satisable, unsatisable, unsatisable (a) , satisable, satisable, unsatisable, unsatisable (b) Fig. 4. Parameters and as functions of C=N for both satisable and unsatisable 3SAT problems with N=100, 125, 150, 175 and 200 (a) and for binary CSPs with D=3, T=2/9, and N=75, 100, and 150(b). Steeper lines correspond to larger values of N.
10 The mean log(deadends) of unsatisable problems grows monotonically with decreasing C=N ratio, except sometimes in the underconstrained region of binary CSPs. This relationship implies that underconstrained inconsistent problems are generally harder to solve than inconsistent problems at the transition point (a theory behind this observation is discussed in [12]). Since the transition region is usually of major interest, we introduce a simplied model that suits that particular region. For example, for 3SAT with C=N < 6, the parameter (mean log(deadends)) can be approximated suciently accurately by a linear function of C=N (see Figure 3(b) and Table 1). Table 1 displays the correlation between the parameters,, and the C=N ratio. We see that is practically linear in C=N in all cases (correlation is almost 1). The last two columns in the table show the negative slope which is decreasing (i.e. the lines become steeper) with increasing N. Note that the slope for is two orders of magnitude smaller than the slope for, so that can be approximated by a constant. Our observations can be described by the so-called linear-lognormal model [11] from reliability studies. The model is commonly applied for accelerated testing. In an example from [11], an engineer selects four test temperatures for the equipment to be tested which are referred to as the stress levels (the higher the stress level the shorter the mean lifetime of a unit tested), and runs several tests on each stress level. Then, using the linear-lognormal model, he estimates and, instead of testing equipment for all possible temperatures. For CSPs and 3SAT, C=N ratio plays the role of the \stress level" aecting the \lifetime" of backtracking. Strictly speaking, the simple linear-lognormal model assumes that 1. Specimen life t at any stress level has a lognormal distribution. 2. The standard deviation of log life is constant. 3. The mean log life at a (possibly transformed by some f(x)) stress level x is (x) = x: Parameters, 0, and 1 are estimated from data. 4. The random variations in the specimen lives are statistically independent. All these assumptions are satised in the case of 3SAT problems. A similar model can be applied to the backtracking algorithms on random binary CSPs, except that grows within the transition region. However, the linear-lognormal model can be modied to t increasing and usually still works for depending on the stress level [11]. The linear lognormal model can be used as well for the overconstrained region, but with a dierent slope. In gure 4, we plotted and computed for both satisable problems and unsatisable problems on 3SAT (Figure 4(a)) and on binary CSPs (Figure 4(b)). Although the satisable problems do not t the lognormal distribution, and still provide useful information on the complexity of backtracking (recall that = mean log(deadends) and = standard deviation log(deadends) ). We see
11 Table 1. Dependence between, and C=N for unsatisable 3SAT problems: correlation and slope are given for each parameter as a function of C=N. N Correlation Slope that there is no peak at the transition point in mean log(deadends) for either satisable or unsatisable problems considered separately. The most dicult unsatisable problems appear in satisable region, and the most dicult satis- able ones appear in unsatisable region. The complexity peaks for satisable and unsatisable problems seem to occur on the opposite sides of the narrow transition region located within C=N 2 [2; 4] rather than at the transition point (see Figure 4). 6 Conclusions and Future Work In this paper, we focus on unsatisable CSP problems, supporting the claim made in [7] that the lognormal distribution approximates well the computational eort required by backtracking-based algorithms on unsatisable CSP instances from the 50% satisable region. In addition, 1. we extend this claim to the non-crossover regions; 2. we show a connection between the performance of backtracking and the law of proportionate eect used to derive the lognormal distribution; 3. we show the applicability of the linear-lognormal model in a relatively wide area around the transition point; 4. we propose using accelerated testing techniques developed in reliability studies for design of experiments with backtracking algorithms. When testing an algorithm on variety of problems (or comparing several algorithms with each other), we would like to know what is the optimal way to spend a xed amount of resources to get a good estimate of the algorithms' performance. The theory of accelerating testing [11] provides us with optimal test plans which minimize the eort of conducting experiments while maximizing the accuracy of the estimates of the model's parameters, given the linear-lognormal model described above. The approach is to select the stress levels (C=N ratios) and to split the number of samples (experiments) among those in such a way that an optimal test will be obtained. The results presented in this paper suggest the following strategy for estimating parameters and for an algorithm and distribution of problems: test
12 a suciently large set of relatively easy unsatisable problems in the overconstrained region, estimate distribution parameters from these samples, derive the coecients of the linear lognormal model from those data, and extrapolate the results to the critical region. Empirical evaluation of accelerated testing strategies for 3SAT and binary CSPs is an area for future research. There are also many theoretical issues to be investigated: what is the appropriate non-linear model for as a function of C=N for xed N how does it change with increasing N how does depend on C=N how to select an optimal test plan, i.e. the set of C=N points and the number of experiments per point for a nonlinear model An important direction for further research is obtaining useful statistical models, both empirically and theoretically, for satisable problems, and combining them with the models of unsatisable problems. Another interesting direction is to investigate the applicability of our results to real-life problems, and to dierent types of backtracking algorithms, including optimization techniques such as branch-and-bound. Acknowledgments We would like to thank Rina Dechter, Eddie Schwalb, and anonymous reviewers whose valuable comments helped to improve the paper. References 1. J. M. Crawford and L. D. Auton. Experimental results on the crossover point in satisability problems. In Proceedings of the Eleventh National Conference on Articial Intelligence, pages 21{27, E. L. Crow and K. Shimizu. Lognormal distributions: theory and applications. Marcel Dekker, Inc., New York, R. B. D'Agostino and M. A. Stephens. Goodness-Of-Fit Techniques. Marcel Dekker, Inc., New York, M. Davis, G. Logemann, and D. Loveland. A Machine Program for Theorem Proving. Communications of the ACM, 5:394{397, R. Dechter and I. Rish. Directional resolution: The davis-putnam procedure, revisited. In Proceedings of KR-94, pages 134{145, D. Frost and R. Dechter. In search of the best constraint satisfaction search. In Proceedings of the Twelfth National Conference on Articial Intelligence, D. Frost, I. Rish, and L. Vila. Summarizing csp hardness with continuous probability distributions. In Proceedings of the Fourteenth National Conference on Articial Intelligence, page (to appear), R. M. Haralick and G. L. Elliott. Increasing Tree Search Eciency for Constraint Satisfaction Problems. Articial Intelligence, 14:263{313, N. R. Mann, R. E. Schafer, and N.D.Singpurwalla. Methods for Statistical Analysis of Reliability and Life Data. John Wiley & Sons, New York, D. Mitchell, B. Selman, and H. Levesque. Hard and Easy Distributions of SAT Problems. In Proceedings of the Tenth National Conference on Articial Intelligence, pages 459{465, 1992.
13 11. W. Nelson. Accelerated Testing: Statistical Models, Test Plans, and Data Analyses. John Wiley & Sons, New York, P. van Beek and R. Dechter. Constraint tightness and looseness versus global consistency. Journal of ACM, page to appear, This article was processed using the LATEX macro package with LLNCS style
Rina Dechter and Irina Rish. Information and Computer Science. University of California, Irvine.
Directional Resolution: The Davis-Putnam Procedure, Revisited 3 Rina Dechter and Irina Rish Information and Computer Science University of California, Irvine dechter@ics.uci.edu, irinar@ics.uci.edu Abstract
More informationAbstract The paper presents an algorithm called directional resolution, avariation on the
Directional Resolution: The Davis-Putnam Procedure, Revisited 3 Rina Dechter and Irina Rish Information and Computer Science University of California, Irvine dechter@ics.uci.edu, irinar@ics.uci.edu Abstract
More informationThe Constrainedness Knife-Edge. Toby Walsh. APES Group. Glasgow, Scotland.
Abstract A general rule of thumb is to tackle the hardest part of a search problem rst. Many heuristics therefore try to branch on the most constrained variable. To test their eectiveness at this, we measure
More informationExploiting a Theory of Phase Transitions in Three-Satisability. Problems. David M. Pennock and Quentin F. Stout. University ofmichigan
Exploiting a Theory of Phase Transitions in Three-Satisability Problems David M. Pennock and Quentin F. Stout Electrical Engineering and Computer Science Department University ofmichigan Ann Arbor, MI
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 31. Propositional Logic: DPLL Algorithm Malte Helmert and Gabriele Röger University of Basel April 24, 2017 Propositional Logic: Overview Chapter overview: propositional
More informationDIMACS Technical Report September 1996
DIMACS Technical Report 96-38 September 1996 How good are branching rules in DPLL? by Ming Ouyang Department of Computer Science Rutgers University New Brunswick, New Jersey 08903 DIMACS is a partnership
More informationEvidence for a Satisability. Threshold for Random 3CNF. Formulas. Tracy Larrabee. Yumi Tsuji y UCSC-CRL November 6, 1992.
Evidence for a Satisability Threshold for Random 3CNF Formulas Tracy Larrabee Yumi Tsuji y UCSC-CRL-92-42 November 6, 1992 Baskin Center for Computer Engineering & Information Sciences University of California,
More informationImplicates and Prime Implicates in Random 3SAT. Robert Schrag. Department of Computer Sciences and Applied Research Laboratories
Implicates and Prime Implicates in Random 3SAT Robert Schrag Department of Computer Sciences and Applied Research Laboratories University of Texas at Austin, C5 Austin, TX 78712 USA Internet: schrag@cs.utexas.edu
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 8. Satisfiability and Model Construction Davis-Putnam-Logemann-Loveland Procedure, Phase Transitions, GSAT Joschka Boedecker and Wolfram Burgard and Bernhard Nebel
More informationAn Empirical Analysis of Search in GSAT. Abstract. We describe an extensive study of search in GSAT, an approximation procedure for
Journal of Articial Intelligence Research 1 (1993) 47-59 Submitted 6/93; published 9/93 An Empirical Analysis of Search in GSAT Ian P. Gent Department of Articial Intelligence, University of Edinburgh
More informationPhase Transitions and Computational Complexity Bart Selman
Phase Transitions and Computational Complexity Bart Selman BS - 08/95 1 Computational Challenges In AI Many core computer science problems have been shown to be computationally intractable. We have results
More informationArtificial Intelligence
Artificial Intelligence Constraint Satisfaction Vibhav Gogate The University of Texas at Dallas Some material courtesy of Rina Dechter, Alex Ihler and Stuart Russell Constraint Satisfaction Problems The
More informationLaboratory for Computer Science. Abstract. We examine the problem of nding a good expert from a sequence of experts. Each expert
Picking the Best Expert from a Sequence Ruth Bergman Laboratory for Articial Intelligence Massachusetts Institute of Technology Cambridge, MA 0239 Ronald L. Rivest y Laboratory for Computer Science Massachusetts
More informationAnalyzing a Heuristic Strategy. for Constraint-Satisfaction and Scheduling. Mark D. Johnston and Steven Minton. Abstract
Analyzing a Heuristic Strategy for Constraint-Satisfaction and Scheduling Mark D. Johnston and Steven Minton Abstract This paper describes a simple heuristic approach to solving large-scale constraint
More informationON THE FAILURE RATE ESTIMATION OF THE INVERSE GAUSSIAN DISTRIBUTION
ON THE FAILURE RATE ESTIMATION OF THE INVERSE GAUSSIAN DISTRIBUTION ZHENLINYANGandRONNIET.C.LEE Department of Statistics and Applied Probability, National University of Singapore, 3 Science Drive 2, Singapore
More informationSolutions. Some of the problems that might be encountered in collecting data on check-in times are:
Solutions Chapter 7 E7.1 Some of the problems that might be encountered in collecting data on check-in times are: Need to collect separate data for each airline (time and cost). Need to collect data for
More informationLecture 9: Search 8. Victor R. Lesser. CMPSCI 683 Fall 2010
Lecture 9: Search 8 Victor R. Lesser CMPSCI 683 Fall 2010 ANNOUNCEMENTS REMEMBER LECTURE ON TUESDAY! EXAM ON OCTOBER 18 OPEN BOOK ALL MATERIAL COVERED IN LECTURES REQUIRED READINGS WILL MOST PROBABLY NOT
More informationComputing the acceptability semantics. London SW7 2BZ, UK, Nicosia P.O. Box 537, Cyprus,
Computing the acceptability semantics Francesca Toni 1 and Antonios C. Kakas 2 1 Department of Computing, Imperial College, 180 Queen's Gate, London SW7 2BZ, UK, ft@doc.ic.ac.uk 2 Department of Computer
More informationproblems from this class. For each combination algorithm C, and for each actual size s, we can dene the worst-case computation time T (C; s) of the co
From Planning to Searching for the Shortest Plan: An Optimal Transition Le Chi Tuan, Joel Galloway Charanjiv Sachar, Vladik Kreinovich Department of Computer Science University of Texas at El Paso El Paso,
More informationLogic in AI Chapter 7. Mausam (Based on slides of Dan Weld, Stuart Russell, Dieter Fox, Henry Kautz )
Logic in AI Chapter 7 Mausam (Based on slides of Dan Weld, Stuart Russell, Dieter Fox, Henry Kautz ) Knowledge Representation represent knowledge in a manner that facilitates inferencing (i.e. drawing
More informationDepartment of Mathematical Sciences, Norwegian University of Science and Technology, Trondheim
Tests for trend in more than one repairable system. Jan Terje Kvaly Department of Mathematical Sciences, Norwegian University of Science and Technology, Trondheim ABSTRACT: If failure time data from several
More informationUnsatised Variables in Local Search. Department of AI Mechanized Reasoning Group. University of Edinburgh IRST, Trento &
Unsatised Variables in Local Search Ian P. Gent Toby Walsh Department of AI Mechanized Reasoning Group University of Edinburgh IRST, Trento & 80 South Bridge, Edinburgh DIST, University of Genoa, United
More informationDr. Maddah ENMG 617 EM Statistics 10/15/12. Nonparametric Statistics (2) (Goodness of fit tests)
Dr. Maddah ENMG 617 EM Statistics 10/15/12 Nonparametric Statistics (2) (Goodness of fit tests) Introduction Probability models used in decision making (Operations Research) and other fields require fitting
More informationSteven Minton 1 Mark D. Johnston 2 Andrew B. Philips 1 Philip Laird 3. NASA Ames Research Center 3700 San Martin Drive, AI Research Branch
Minimizing Conicts: A Heuristic Repair Method for Constraint-Satisfaction and Scheduling Problems Steven Minton 1 Mark D. Johnston 2 Andrew B. Philips 1 Philip Laird 3 1 Sterling Federal Systems 2 Space
More informationPerformance of Low Density Parity Check Codes. as a Function of Actual and Assumed Noise Levels. David J.C. MacKay & Christopher P.
Performance of Low Density Parity Check Codes as a Function of Actual and Assumed Noise Levels David J.C. MacKay & Christopher P. Hesketh Cavendish Laboratory, Cambridge, CB3 HE, United Kingdom. mackay@mrao.cam.ac.uk
More information1/sqrt(B) convergence 1/B convergence B
The Error Coding Method and PICTs Gareth James and Trevor Hastie Department of Statistics, Stanford University March 29, 1998 Abstract A new family of plug-in classication techniques has recently been
More informationA Comparison of Methods for Solving MAX-SAT. Problems. Steve Joy, John E. Mitchell.
A Comparison of Methods for Solving MAX-SAT Problems Steve Jo, John E. Mitchell Mathematical Sciences, Rensselaer Poltechnic Institute, Tro NY 12180 USA. email: jos@rpi.edu, mitchj@rpi.edu http://www.math.rpi.edu/~mitchj
More informationIntroduction The goal of this paper is to describe and thoroughly test a new decision procedure, called Ksat, checking satisability in the terminologi
A SAT-based decision procedure for ALC Fausto Giunchiglia ;2 Roberto Sebastiani 3 IRST, 38050 Povo (TN), Italy. ph: ++39.46.34436 2 DISA, via Inama 5, 3800 Trento 3 DIST, v. Causa 3, 646 Genoa, Italy.
More information0 o 1 i B C D 0/1 0/ /1
A Comparison of Dominance Mechanisms and Simple Mutation on Non-Stationary Problems Jonathan Lewis,? Emma Hart, Graeme Ritchie Department of Articial Intelligence, University of Edinburgh, Edinburgh EH
More informationDistribution Fitting (Censored Data)
Distribution Fitting (Censored Data) Summary... 1 Data Input... 2 Analysis Summary... 3 Analysis Options... 4 Goodness-of-Fit Tests... 6 Frequency Histogram... 8 Comparison of Alternative Distributions...
More informationPROD. TYPE: COM ARTICLE IN PRESS. Computational Statistics & Data Analysis ( )
COMSTA 28 pp: -2 (col.fig.: nil) PROD. TYPE: COM ED: JS PAGN: Usha.N -- SCAN: Bindu Computational Statistics & Data Analysis ( ) www.elsevier.com/locate/csda Transformation approaches for the construction
More informationBacktracking search: look-back. ICS 275 Spring 2014
Backtracking search: look-back ICS 275 Look-back: Backjumping / Learning Backjumping: In deadends, go back to the most recent culprit. Learning: constraint-recording, nogood recording. good-recording Backjumping
More informationStatistical Inference
Statistical Inference Bernhard Klingenberg Institute of Statistics Graz University of Technology Steyrergasse 17/IV, 8010 Graz www.statistics.tugraz.at February 12, 2008 Outline Estimation: Review of concepts
More informationA Random Jump Strategy for Combinatorial Search
A Random Jump Strategy for Combinatorial Search Hantao Zhang Computer Science Department The University of Iowa Iowa City, IA 52242 hzhang@cs.uiowa.edu December 3, 2001 Abstract Recent work on the combinatorial
More informationAn Architecture for a WWW Workload Generator. Paul Barford and Mark Crovella. Boston University. September 18, 1997
An Architecture for a WWW Workload Generator Paul Barford and Mark Crovella Computer Science Department Boston University September 18, 1997 1 Overview SURGE (Scalable URL Reference Generator) is a WWW
More informationStudy of symmetry in Constraint Satisfaction Problems? Belaid Benhamou. URA CNRS Universite de Provence,
Study of symmetry in Constraint Satisfaction Problems? Belaid Benhamou URA CNRS 1787 - Universite de Provence,,Place Victor Hugo - F11 Marseille cedex, France phone number : 91.1.61.8 e-mail : Benhamou@gyptis.univ-mrs.fr
More informationA Preference Semantics. for Ground Nonmonotonic Modal Logics. logics, a family of nonmonotonic modal logics obtained by means of a
A Preference Semantics for Ground Nonmonotonic Modal Logics Daniele Nardi and Riccardo Rosati Dipartimento di Informatica e Sistemistica, Universita di Roma \La Sapienza", Via Salaria 113, I-00198 Roma,
More informationChapter 4. Displaying and Summarizing. Quantitative Data
STAT 141 Introduction to Statistics Chapter 4 Displaying and Summarizing Quantitative Data Bin Zou (bzou@ualberta.ca) STAT 141 University of Alberta Winter 2015 1 / 31 4.1 Histograms 1 We divide the range
More informationIE 303 Discrete-Event Simulation
IE 303 Discrete-Event Simulation 1 L E C T U R E 5 : P R O B A B I L I T Y R E V I E W Review of the Last Lecture Random Variables Probability Density (Mass) Functions Cumulative Density Function Discrete
More informationQuality of LP-based Approximations for Highly Combinatorial Problems
Quality of LP-based Approximations for Highly Combinatorial Problems Lucian Leahu and Carla P. Gomes Dpt. of Computer Science, Cornell University, Ithaca, NY 4853, USA, {lleahu,gomes}@cs.cornell.edu Abstract.
More informationProbabilistic Analysis of Local Search and NP-Completeness Result for Constraint Satisfaction
Probabilistic Analysis of Local Search and NP-Completeness Result for Constraint Satisfaction (Extended Abstract) Hoong Chuin LAU Dept. of Computer Science, Tokyo Institute of Technology 2-12-1 Ookayama,
More informationVandegriend & Culberson Section 6 we examine a graph class based on a generalization of the knight's tour problem. These graphs are signicantly harder
Journal of Articial Intelligence Research 9 (1998) 219-245 Submitted 3/98; published 11/98 The G n;m Phase Transition is Not Hard for the Hamiltonian Cycle Problem Basil Vandegriend Joseph Culberson Department
More informationGIST 4302/5302: Spatial Analysis and Modeling
GIST 4302/5302: Spatial Analysis and Modeling Basics of Statistics Guofeng Cao www.myweb.ttu.edu/gucao Department of Geosciences Texas Tech University guofeng.cao@ttu.edu Spring 2015 Outline of This Week
More informationDD2446 Complexity Theory: Problem Set 4
DD2446 Complexity Theory: Problem Set 4 Due: Friday November 8, 2013, at 23:59. Submit your solutions as a PDF le by e-mail to jakobn at kth dot se with the subject line Problem set 4: your full name.
More informationComparisons of Approximate Confidence Interval Procedures for Type I Censored Data
Statistics Preprints Statistics 6-6-999 Comparisons of Approximate Confidence Interval Procedures for Type I Censored Data Shuen-Lin Jeng Ming-Chuan University William Q. Meeker Iowa State University,
More informationThe Interface between P and NP. Toby Walsh Cork Constraint Computation Centre
The Interface between P and NP Toby Walsh Cork Constraint Computation Centre http://4c.ucc.ie/~tw 3-SAT Where are the hard 3-SAT problems? Sample randomly generated 3-SAT Fix number of clauses, l Number
More informationChapter 6. Estimation of Confidence Intervals for Nodal Maximum Power Consumption per Customer
Chapter 6 Estimation of Confidence Intervals for Nodal Maximum Power Consumption per Customer The aim of this chapter is to calculate confidence intervals for the maximum power consumption per customer
More informationCalculation of maximum entropy densities with application to income distribution
Journal of Econometrics 115 (2003) 347 354 www.elsevier.com/locate/econbase Calculation of maximum entropy densities with application to income distribution Ximing Wu Department of Agricultural and Resource
More informationEstimating Fatigue Curves With the Random Fatigue-Limit Mode
Statistics Preprints Statistics 1997 Estimating Fatigue Curves With the Random Fatigue-Limit Mode Francis G. Pascual Washington State University William Q. Meeker Iowa State University, wqmeeker@iastate.edu
More informationAN EXPECTED-COST ANALYSIS OF BACKTRACKING AND NON-BACKTRACKING ALGORITHMS
AN EXPECTED-COST ANALYSIS OF BACKTRACKING AND NON-BACKTRACKING ALGORITHMS C.J.H. McDiarmid Department of Statistics University of Oxford Oxford England 0X1 3TG email: MCD@vax.oxford.ac.uk G.M.A. Provan
More informationLinear Regression and Its Applications
Linear Regression and Its Applications Predrag Radivojac October 13, 2014 Given a data set D = {(x i, y i )} n the objective is to learn the relationship between features and the target. We usually start
More informationTemporal Reasoning with Constraints. on Fluents and Events 3.
Temporal Reasoning with Constraints on Fluents and Events 3 Eddie Schwalb, Kalev Kask, Rina Dechter Department of Information and Computer Science University of California, Irvine CA 92717 feschwalb,kkask,dechterg@ics.uci.edu
More informationPRUNING PROCEDURE FOR INCOMPLETE-OBSERVATION DIAGNOSTIC MODEL SIMPLIFICATION
PRUNING PROCEDURE FOR INCOMPLETE-OBSERVATION DIAGNOSTIC MODEL SIMPLIFICATION Ivan Havel Department of Cybernetics Faculty of Electrical Engineering, Czech Technical University Karlovo náměstí 13, 121 35
More informationIntrinsic and Cosmological Signatures in Gamma-Ray Burst Time Proles: Time Dilation Andrew Lee and Elliott D. Bloom Stanford Linear Accelerator Center
SLAC{PUB{8365 February 2000 Intrinsic and Cosmological Signatures in Gamma-Ray Burst Time Proles: Time Dilation Andrew Lee and Elliott D. Bloom Stanford Linear Accelerator Center, Stanford University,
More informationARTIFICIAL INTELLIGENCE LABORATORY. and CENTER FOR BIOLOGICAL INFORMATION PROCESSING. A.I. Memo No August Federico Girosi.
MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLIGENCE LABORATORY and CENTER FOR BIOLOGICAL INFORMATION PROCESSING WHITAKER COLLEGE A.I. Memo No. 1287 August 1991 C.B.I.P. Paper No. 66 Models of
More informationAn exact approach to early/tardy scheduling with release dates
Computers & Operations Research 32 (2005) 2905 2917 www.elsevier.com/locate/dsw An exact approach to early/tardy scheduling with release dates Jorge M.S. Valente, Rui A.F.S. Alves Faculdade de Economia,
More informationChapter 17. Failure-Time Regression Analysis. William Q. Meeker and Luis A. Escobar Iowa State University and Louisiana State University
Chapter 17 Failure-Time Regression Analysis William Q. Meeker and Luis A. Escobar Iowa State University and Louisiana State University Copyright 1998-2008 W. Q. Meeker and L. A. Escobar. Based on the authors
More informationArtificial Intelligence
Torralba and Wahlster Artificial Intelligence Chapter 11: Propositional Reasoning, Part II 1/69 Artificial Intelligence 11. Propositional Reasoning, Part II: SAT Solvers How to Efficiently Think About
More informationLearning Conditional Probabilities from Incomplete Data: An Experimental Comparison Marco Ramoni Knowledge Media Institute Paola Sebastiani Statistics
Learning Conditional Probabilities from Incomplete Data: An Experimental Comparison Marco Ramoni Knowledge Media Institute Paola Sebastiani Statistics Department Abstract This paper compares three methods
More informationConstraint satisfaction search. Combinatorial optimization search.
CS 1571 Introduction to AI Lecture 8 Constraint satisfaction search. Combinatorial optimization search. Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square Constraint satisfaction problem (CSP) Objective:
More informationICML '97 and AAAI '97 Tutorials
A Short Course in Computational Learning Theory: ICML '97 and AAAI '97 Tutorials Michael Kearns AT&T Laboratories Outline Sample Complexity/Learning Curves: nite classes, Occam's VC dimension Razor, Best
More informationNovel determination of dierential-equation solutions: universal approximation method
Journal of Computational and Applied Mathematics 146 (2002) 443 457 www.elsevier.com/locate/cam Novel determination of dierential-equation solutions: universal approximation method Thananchai Leephakpreeda
More informationWorst-Case Upper Bound for (1, 2)-QSAT
Worst-Case Upper Bound for (1, 2)-QSAT Minghao Yin Department of Computer, Northeast Normal University, Changchun, China, 130117 ymh@nenu.edu.cn Abstract. The rigorous theoretical analysis of the algorithm
More informationOptimum Hybrid Censoring Scheme using Cost Function Approach
Optimum Hybrid Censoring Scheme using Cost Function Approach Ritwik Bhattacharya 1, Biswabrata Pradhan 1, Anup Dewanji 2 1 SQC and OR Unit, Indian Statistical Institute, 203, B. T. Road, Kolkata, PIN-
More informationIncremental Recompilation of Knowledge
Journal of Articial Intelligence Research 8 (1998) 23-37 Submitted 1/97; published 1/98 Incremental Recompilation of Knowledge Goran Gogic University of California at San Diego Computer Science Department
More informationAbstract. This paper discusses polynomial-time reductions from Hamiltonian Circuit (HC),
SAT-Variable Complexity of Hard Combinatorial Problems Kazuo Iwama and Shuichi Miyazaki Department of Computer Science and Communication Engineering Kyushu University, Hakozaki, Higashi-ku, Fukuoka 812,
More informationChapter Learning Objectives. Probability Distributions and Probability Density Functions. Continuous Random Variables
Chapter 4: Continuous Random Variables and Probability s 4-1 Continuous Random Variables 4-2 Probability s and Probability Density Functions 4-3 Cumulative Functions 4-4 Mean and Variance of a Continuous
More information[3] R.M. Colomb and C.Y.C. Chung. Very fast decision table execution of propositional
- 14 - [3] R.M. Colomb and C.Y.C. Chung. Very fast decision table execution of propositional expert systems. Proceedings of the 8th National Conference on Articial Intelligence (AAAI-9), 199, 671{676.
More informationChapter 7 R&N ICS 271 Fall 2017 Kalev Kask
Set 6: Knowledge Representation: The Propositional Calculus Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask Outline Representing knowledge using logic Agent that reason logically A knowledge based agent Representing
More informationp(z)
Chapter Statistics. Introduction This lecture is a quick review of basic statistical concepts; probabilities, mean, variance, covariance, correlation, linear regression, probability density functions and
More informationCompiling Knowledge into Decomposable Negation Normal Form
Compiling Knowledge into Decomposable Negation Normal Form Adnan Darwiche Cognitive Systems Laboratory Department of Computer Science University of California Los Angeles, CA 90024 darwiche@cs. ucla. edu
More informationSTAT 6350 Analysis of Lifetime Data. Probability Plotting
STAT 6350 Analysis of Lifetime Data Probability Plotting Purpose of Probability Plots Probability plots are an important tool for analyzing data and have been particular popular in the analysis of life
More informationBoxlets: a Fast Convolution Algorithm for. Signal Processing and Neural Networks. Patrice Y. Simard, Leon Bottou, Patrick Haner and Yann LeCun
Boxlets: a Fast Convolution Algorithm for Signal Processing and Neural Networks Patrice Y. Simard, Leon Bottou, Patrick Haner and Yann LeCun AT&T Labs-Research 100 Schultz Drive, Red Bank, NJ 07701-7033
More information2 SUMMARISING APPROXIMATE ENTAILMENT In this section we will summarise the work in (Schaerf and Cadoli 995), which denes the approximate entailment re
Computing approximate diagnoses by using approximate entailment Annette ten Teije SWI University of Amsterdam The Netherlands annette@swi.psy.uva.nl Abstract The most widely accepted models of diagnostic
More informationOn evaluating decision procedures for modal logic
On evaluating decision procedures for modal logic Ullrich Hustadt and Renate A. Schmidt Max-Planck-Institut fur Informatik, 66123 Saarbriicken, Germany {hustadt, schmidt} topi-sb.mpg.de Abstract This paper
More informationStep-Stress Models and Associated Inference
Department of Mathematics & Statistics Indian Institute of Technology Kanpur August 19, 2014 Outline Accelerated Life Test 1 Accelerated Life Test 2 3 4 5 6 7 Outline Accelerated Life Test 1 Accelerated
More informationPredicting a Future Median Life through a Power Transformation
Predicting a Future Median Life through a Power Transformation ZHENLIN YANG 1 Department of Statistics and Applied Probability, National University of Singapore, 3 Science Drive 2, Singapore 117543 Abstract.
More informationConfidence Intervals. Confidence interval for sample mean. Confidence interval for sample mean. Confidence interval for sample mean
Confidence Intervals Confidence interval for sample mean The CLT tells us: as the sample size n increases, the sample mean is approximately Normal with mean and standard deviation Thus, we have a standard
More informationLecture 14 - P v.s. NP 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 27, 2018 Lecture 14 - P v.s. NP 1 In this lecture we start Unit 3 on NP-hardness and approximation
More informationThe best expert versus the smartest algorithm
Theoretical Computer Science 34 004 361 380 www.elsevier.com/locate/tcs The best expert versus the smartest algorithm Peter Chen a, Guoli Ding b; a Department of Computer Science, Louisiana State University,
More informationLearning Objectives for Stat 225
Learning Objectives for Stat 225 08/20/12 Introduction to Probability: Get some general ideas about probability, and learn how to use sample space to compute the probability of a specific event. Set Theory:
More informationLogic in AI Chapter 7. Mausam (Based on slides of Dan Weld, Stuart Russell, Subbarao Kambhampati, Dieter Fox, Henry Kautz )
Logic in AI Chapter 7 Mausam (Based on slides of Dan Weld, Stuart Russell, Subbarao Kambhampati, Dieter Fox, Henry Kautz ) 2 Knowledge Representation represent knowledge about the world in a manner that
More informationp-birnbaum SAUNDERS DISTRIBUTION: APPLICATIONS TO RELIABILITY AND ELECTRONIC BANKING HABITS
p-birnbaum SAUNDERS DISTRIBUTION: APPLICATIONS TO RELIABILITY AND ELECTRONIC BANKING 1 V.M.Chacko, Mariya Jeeja P V and 3 Deepa Paul 1, Department of Statistics St.Thomas College, Thrissur Kerala-681 e-mail:chackovm@gmail.com
More informationFinding optimal configurations ( combinatorial optimization)
CS 1571 Introduction to AI Lecture 10 Finding optimal configurations ( combinatorial optimization) Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square Constraint satisfaction problem (CSP) Constraint
More informationExponential Separations in a Hierarchy of Clause Learning Proof Systems
Electronic Colloquium on Computational Complexity, Report No. 72 (2013) Exponential Separations in a Hierarchy of Clause Learning Proof Systems Jan Johannsen Institut fur Informatik Ludwig-Maximilians-Universitat
More informationClause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Journal of Artificial Intelligence Research 1 (1993) 1-15 Submitted 6/91; published 9/91 Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas Enrico Giunchiglia Massimo
More informationSeismic Analysis of Structures Prof. T.K. Datta Department of Civil Engineering Indian Institute of Technology, Delhi. Lecture 03 Seismology (Contd.
Seismic Analysis of Structures Prof. T.K. Datta Department of Civil Engineering Indian Institute of Technology, Delhi Lecture 03 Seismology (Contd.) In the previous lecture, we discussed about the earth
More information#A32 INTEGERS 10 (2010), TWO NEW VAN DER WAERDEN NUMBERS: w(2; 3, 17) AND w(2; 3, 18)
#A32 INTEGERS 10 (2010), 369-377 TWO NEW VAN DER WAERDEN NUMBERS: w(2; 3, 17) AND w(2; 3, 18) Tanbir Ahmed ConCoCO Research Laboratory, Department of Computer Science and Software Engineering, Concordia
More informationIntroduction. Chapter Context
Chapter 1 Introduction As soon as an Analytical Engine exists, it will necessarily guide the future course of the science. Whenever any result is sought by its aid, the question will then arise But what
More informationComputational Logic. Davide Martinenghi. Spring Free University of Bozen-Bolzano. Computational Logic Davide Martinenghi (1/30)
Computational Logic Davide Martinenghi Free University of Bozen-Bolzano Spring 2010 Computational Logic Davide Martinenghi (1/30) Propositional Logic - sequent calculus To overcome the problems of natural
More informationTime / T p
Chapter 5 Single-Point QNS Measurements 5. Overview A total of 46 primary test cases were evaluated using the QNS technique. These cases duplicated the 8 studied by Ainley [] and extend the parameters
More informationOn estimation of the Poisson parameter in zero-modied Poisson models
Computational Statistics & Data Analysis 34 (2000) 441 459 www.elsevier.com/locate/csda On estimation of the Poisson parameter in zero-modied Poisson models Ekkehart Dietz, Dankmar Bohning Department of
More information4.1 Notation and probability review
Directed and undirected graphical models Fall 2015 Lecture 4 October 21st Lecturer: Simon Lacoste-Julien Scribe: Jaime Roquero, JieYing Wu 4.1 Notation and probability review 4.1.1 Notations Let us recall
More informationMax. Likelihood Estimation. Outline. Econometrics II. Ricardo Mora. Notes. Notes
Maximum Likelihood Estimation Econometrics II Department of Economics Universidad Carlos III de Madrid Máster Universitario en Desarrollo y Crecimiento Económico Outline 1 3 4 General Approaches to Parameter
More informationPruning Search Space for Weighted First Order Horn Clause Satisfiability
Pruning Search Space for Weighted First Order Horn Clause Satisfiability Naveen Nair 123, Anandraj Govindan 2, Chander Jayaraman 2, Kiran TVS 2, and Ganesh Ramakrishnan 21 1 IITB-Monash Research Academy,
More informationbelow, kernel PCA Eigenvectors, and linear combinations thereof. For the cases where the pre-image does exist, we can provide a means of constructing
Kernel PCA Pattern Reconstruction via Approximate Pre-Images Bernhard Scholkopf, Sebastian Mika, Alex Smola, Gunnar Ratsch, & Klaus-Robert Muller GMD FIRST, Rudower Chaussee 5, 12489 Berlin, Germany fbs,
More informationImproving Repair-based Constraint Satisfaction Methods by Value Propagation
From: AAAI-94 Proceedings. Copyright 1994, AAAI (www.aaai.org). All rights reserved. Improving Repair-based Constraint Satisfaction Methods by Value Propagation Nobuhiro Yugami Yuiko Ohta Mirotaka Nara
More informationLocal and Stochastic Search
RN, Chapter 4.3 4.4; 7.6 Local and Stochastic Search Some material based on D Lin, B Selman 1 Search Overview Introduction to Search Blind Search Techniques Heuristic Search Techniques Constraint Satisfaction
More informationInstitute of Actuaries of India
Institute of Actuaries of India Subject CT3 Probability and Mathematical Statistics For 2018 Examinations Subject CT3 Probability and Mathematical Statistics Core Technical Syllabus 1 June 2017 Aim The
More informationPhase transitions in Boolean satisfiability and graph coloring
Phase transitions in Boolean satisfiability and graph coloring Alexander Tsiatas May 8, 2008 Abstract I analyzed the behavior of the known phase transitions in two NPcomplete problems, 3-colorability and
More information