共查询到19条相似文献,搜索用时 46 毫秒
1.
随机约束满足问题是经典的NP完全问题,在理论研究和现实生活中有着广泛应用。研究人员发现随机约束满足问题存在相变现象,近几十年来关于此问题相变的研究成果不断涌现。从随机图着色问题和随机可满足问题2个最经典的随机约束满足问题入手,从算法研究、理论物理和数学证明3个方面综述了随机图着色问题和随机可满足问题的相变研究成果。最后对随机约束满足问题相变的研究趋势进行了展望。 相似文献
2.
为了求解具有增长取值域的随机约束满足问题(CSP),提出了一种基于禁忌搜索并与模拟退火相结合的算法。首先,利用禁忌搜索得到一组启发式的初始赋值,即由一个随机初始化的可行解通过邻域构造一组候选解,再利用禁忌表使候选解向最小化目标函数值的方向移动;如果得到的最优赋值不是问题的解,就把它作为启发式的初始赋值,再执行模拟退火对这组赋值进行修正直到得到全局最优解。数值实验结果表明,所提算法在接近问题的理论相变阈值时仍然能有效地找到问题的解,与其他局部搜索算法相比,表现出了显著的优越性,可用于随机CSP的算法设计。 相似文献
3.
4.
一种基于变量熵求解约束满足问题的置信传播算法 总被引:1,自引:0,他引:1
在置信传播(belief propagation,BP)算法中,提出一种基于变量熵来挑选变量从而固定变量赋值的策略,用于求解一类具有增长定义域的随机约束满足问题.RB模型是一个具有增长定义域的随机约束满足问题的典型代表,已经严格证明它不仅存在精确的可满足性相变现象,而且可以生成难解实例.在RB模型上选取两组不同的参数进行数值实验.结果表明:在接近可满足性相变点时,BP引导的消去算法仍然可以非常有效地找到随机实例的解;不断增加问题的规模,算法的运行时间呈指数级增长;并且当控制参数(约束紧度)增加时,变量的平均自由度逐渐降低. 相似文献
5.
几何设计约束的表示与满足问题研究 总被引:3,自引:1,他引:2
对于智能CAD系统来说,具有解决几何设计约束的功能是重要的。本文提出了一种面向对象的几何设计约束表示方法,它可以通过两种方式来表达。文中给出了一个约束传播算法,用于解决约束满足问题。 相似文献
6.
提出了在二元约束满足问题中以搜索结点个数为衡量标准的求解开销模型,该模型被应用于随机二元约束满足问题的求解开销相变分析中,并且比较了模型所导出的理论开销和实际中的搜索结点个数、约束检查次数、求解时间3种衡量标准的开销之间的相似性.在模型的基础上,探讨了求解启发式减少求解开销的作用,给出了一个新的变量选择启发式. 相似文献
7.
约束满足问题求解途径之比较与分析 总被引:1,自引:0,他引:1
本文从逻辑,自动机理论,代数方法,连接主义框架和遗传算法的角度深入地探讨了CSP问题的不同表示框架和求解风范,详细分析和讨论了不同表示和求解方法的特点以及它们之间的内在联系和可能的结合。 相似文献
8.
9.
10.
11.
Threshold behaviors of a random constraint satisfaction problem with exact phase transitions 总被引:2,自引:0,他引:2
We consider a random constraint satisfaction problem named model RB, which exhibits a sharp satisfiability phase-transition phenomenon when the control parameters pass through the critical values denoted by rcr and pcr. Using finite-size scaling analysis, we bound the width of the transition region for finite problem size n, which might be the first rigorous study on the threshold behaviors of NP-complete problems. 相似文献
12.
Backtracking and random constraint satisfaction 总被引:2,自引:0,他引:2
Paul Walton Purdom 《Annals of Mathematics and Artificial Intelligence》1997,20(1-4):393-410
The average running time used by backtracking on random constraint satisfaction problems is studied. This time is polynomial
when the ratio of constraints to variables is large, and it is exponential when the ratio is small. When the number of variables
goes to infinity, whether the average time is exponential or polynomial depends on the number of variables per constraint,
the number of values per variable, and the probability that a random setting of variables satisfies a constraint. A method
for computing the curve that separates polynomial from exponential time and several methods for approximating the curve are
given. The version of backtracking studied finds all solutions to a problem, so the running time is exponential when the number
of solutions per problem is exponential. For small values of the probability, the curve that separates exponential and polynomial
average running time coincides with the curve that separates an exponential average number of solutions from a polynomial
number. For larger probabilities the two curves diverge. Random problems similar to those that arise in understanding line
drawings with shadows require a time that is mildly exponential when they are solved by simple backtracking. Slightly more
sophisticated algorithms (such as constraint propagation combined with backtracking) should be able to solve these rapidly.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
13.
《Intelligent Data Analysis》1998,2(1-4):45-62
Constraint satisfaction is at the core of many applications, such as scheduling. The study of phase transition has benefited algorithm selection and algorithm development in constraint satisfaction. Recent research provides evidence that constraint graph topology affects where phase transitions occur in constraint satisfaction problems. In this article, a new phase transition predictor which takes constraint graph information into consideration is proposed. The new predictor allows variation in the tightness of individual constraints and node degree variation in constraint graph. Experiments were conducted to study the usefulness of the new predictor on random binary constraint satisfaction problems. Results show that the new predictor is able to produce predictions as good as the state-of-the-art predictor in general, but do considerably better in sparsely constrained problems, particularly when the node degree variation in their constraint graphs is high. 相似文献
14.
Production management as a constraint satisfaction problem 总被引:2,自引:0,他引:2
MARKKU SYRJÄNEN 《Journal of Intelligent Manufacturing》1998,9(6):515-522
Production management problems can be quite straightforwardly presented as constraint satisfaction problems, where values for some variables are searched for under a set of constraints. A combination of an operation and a resource is usually interpreted as the variable, and a time window is usually interpreted as the value to be searched for. This convention is challenged. A case is considered where the most appropriate interpretation treats the combination of a resource and a time window as the variable, and an operation as the value. A third possible interpretation is also briefly covered, where the combination of an operation and a time window is the variable, and the resource is the value. 相似文献
15.
测试经理在制定测试计划时,往往只能依靠个人经验,缺乏理论方法的指导,面对复杂软件系统时难以全面考虑测试模块间关系及测试人员能力等复杂因素,往往使得测试效果并不令人满意.将约束规划技术引入测试领域,结合测试计划自身特点,提出了一种全新的基于约束满足的测试计划方法.方法将软件产品划分为测试模块,通过确定各模块测试过程及过程间顺序约束、资源能力约束,对测试计划问题进行了约束建模和求解.并以项目管理软件SoftPM的测试过程为例,对方法的具体应用进行了介绍. 相似文献
16.
Yokoo M. Durfee E.H. Ishida T. Kuwabara K. 《Knowledge and Data Engineering, IEEE Transactions on》1998,10(5):673-685
We develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various application problems in distributed artificial intelligence can be formalized as distributed CSPs. We present our newly developed technique called asynchronous backtracking that allows agents to act asynchronously and concurrently without any global control, while guaranteeing the completeness of the algorithm. Furthermore, we describe how the asynchronous backtracking algorithm can be modified into a more efficient algorithm called an asynchronous weak-commitment search, which can revise a bad decision without exhaustive search by changing the priority order of agents dynamically. The experimental results on various example problems show that the asynchronous weak-commitment search algorithm is, by far more, efficient than the asynchronous backtracking algorithm and can solve fairly large-scale problems 相似文献
17.
Inductive Logic Programming (ILP) deals with the problem of finding a hypothesis covering positive examples and excluding negative examples, where both hypotheses and examples are expressed in first-order logic. In this paper we employ constraint satisfaction techniques to model and solve a problem known as template ILP consistency, which assumes that the structure of a hypothesis is known and the task is to find unification of the contained variables. In particular, we present a constraint model with index variables accompanied by a Boolean model to strengthen inference and hence improve efficiency. The efficiency of models is demonstrated experimentally. 相似文献
18.
Constraint satisfaction has received increasing attention over the years. Intense research has focused on solving all kinds of constraint satisfaction problems (CSPs). In this paper, first we propose a random CSP model, named k-CSP, that guarantees the existence of phase transitions under certain circumstances. The exact location of the phase transition is quantified and experimental results are provided to illustrate the performance of the proposed model. Second, we revise the model k-CSP to a random linear CSP by incorporating certain linear structure to constraint relations. We also prove the existence of the phase transition and exhibit its exact location for this random linear CSP model. 相似文献
19.
We study the connection between the order of phase transitions in combinatorial problems and the complexity of decision algorithms for such problems. We rigorously show that, for a class of random constraint satisfaction problems, a limited connection between the two phenomena indeed exists. Specifically, we extend the definition of the spine order parameter of Bollobás et al. [10] to random constraint satisfaction problems, rigorously showing that for such problems a discontinuity of the spine is associated with a 2Ω(n) resolution complexity (and thus a 2Ω(n) complexity of DPLL algorithms) on random instances. The two phenomena have a common underlying cause: the emergence of “large” (linear size) minimally unsatisfiable subformulas of a random formula at the satisfiability phase transition.We present several further results that add weight to the intuition that random constraint satisfaction problems with a sharp threshold and a continuous spine are “qualitatively similar to random 2-SAT”. Finally, we argue that it is the spine rather than the backbone parameter whose continuity has implications for the decision complexity of combinatorial problems, and we provide experimental evidence that the two parameters can behave in a different manner.AMS subject classification 68Q25, 82B27 相似文献