搜索资源列表
sat_problem
- 这是算法中关于SAT问题的解决方法,希望对你有帮助,-This the algorithm on the SAT the solution to the problem, and I hope to help you, thank you
sp-1.4
- 人工智能的一个重要方法,随机SAT问题,即一种复杂的组合优化方法,算法清晰,简单,易懂,但涉及较深的数学知识,(该源码基于linux平台的C程序)
Project
- C 语言开发的日历(课程设计很不错的) Month:123/1 --- --- --- Sun Mon Tue Wed Thu Fri Sat 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
cyclist
- 链表的基本操作,循环链表的一个应用实例,围桌问题的一个解决方法!-Chain basic operation, the recycling Chain an example, sat around the table in a solution!
用c++实现2cnf-sat问题的图形解决方法
- 2cnf-sat问题用c++实现的图形解决方法,2cnf-sat problems using c++ Achieve graphical solution
bb
- (1)一个理发店接待室有n张椅子,工作室有1张椅子; (2)没有顾客时,理发师睡觉; (3)第一个顾客来到时,必须将理发师唤醒; (4)顾客来时如果还有空座的话,他就坐在一个座位上等待; (5)如果顾客来时没有空座位了,他就离开,不理发了; (6)当理发师处理完所有顾客,而又没有新顾客来时,他又开始睡觉。 用条件变量实现(3张椅子) -(1) a barber shop in the reception room with n chairs, the stu
zchaff
- 命题逻辑的求解器,2004年SAT竞赛第一名的求解器 -Propositional logic solver, in 2004 the first race of the SAT solver
satproblem
- 自己编写的,SAT问题的Johnson算法源代码,请多多指教-I have written, SAT question of the Johnson algorithm source code, please advice
sat
- FDM卫星通信仿真程序及一些辅助函数,共有六条上行链路-FDM satellite communication simulation program and some auxiliary functions, a total of six uplink
Worldsat
- world sat ultimate bin ab sat decrypter for stm 5000 ng 9-world sat ultimate bin ab sat decrypter for stm 5000 ng 9000
walksat-dist
- 解决SAT问题的经典WalkSat算法,基于linux平台开发。-Typical WalkSat algorithm designed for solving SAT problem, developed based on Linux platform.
sat
- 对于给定的带权 3-CNF,设计一个蒙特卡罗算法,使其权值之和尽可能大。此程序可以解决这个问题-For a given weighted 3-CNF, a Monte Carlo algorithm designed to make the right value, and as large as possible. This program can solve this problem
SAT-GA
- 遗传算法 整个流程清晰明了 属于课程提交作业 有点精简-Clarity of the genetic algorithm process is a little program to streamline the job submission
simulated-annealing-SAT
- 另一版本的模拟退火算法SA求解SAT问题 内附比较详细说明-Another version of the simulated annealing SA algorithm to solve SAT problems containing a more detailed descr iption of
ExGA-SAT.tar
- This is a modified c++ code for Max-SAT problem based on genetic algorithm
2-SAT
- 现有一个由N个布尔值组成的序列A,给出一些限制关系,比如A[x] AND A[y]=0、A[x] OR A[y] OR A[z]=1等,要确定A[0..N-1]的值,使得其满足所有限制关系。这个称为SAT问题,特别的,若每种限制关系中最多只对两个元素进行限制,称为2-SAT问题-Present a Boolean value of N consisting of the sequence A, the relationship given some restrictions, such as A
SAT
- SAT问题也称为合取范式的可满足问题,一个合取范式形如:A1∧A2∧…∧An,子句Ai(1≤i≤n)形如:a1∨a2∨…∨ak,其中,ai称为文字,为某一布尔变量或该布尔变量的非。SAT问题是指:是否存在一组对所有布尔变量的赋值(TRUE或FALSE),使得整个合取范式取值为真。 -SAT problems are also called conjunctive normal form of the satisfiability problem, a conjunctive normal
PKU-PS_3683-2-sat
- 解决3sat经典问题的模板算法,可随问题的文法少做变更即可-the template for 2-SAT
2-sat
- 所为2-sat问题,就是2判断问题。该算法是用拆点的方式建图,用找强连通子图的方法推出矛盾,用以判断2-sat是否可行。经典实现,-2-sat, is a matter of judgment. The algorithm is used to find a demolition point built strongly connected subgraph launched contradictions, used to determine whether the 2-sat. Classic
tempo-sat-tlp-gp
- SAT-TLP规划器是由ML这一通用的函数式编程语言开发出的最优化规划器,对于了解函数式语言在大型系统中的应用以及智能规划理论提供了很好的支持。-SAT-TLP planning is developed by ML generic functional programming language optimized planning, and provides good support for understanding the functional languages ̴