搜索资源列表
用c++实现2cnf-sat问题的图形解决方法
- 2cnf-sat问题用c++实现的图形解决方法,2cnf-sat problems using c++ Achieve graphical solution
3SAT-NP-Completeness
- Proff of the NP-Completeness of the 3-SAT problem
zchaff
- 命题逻辑的求解器,2004年SAT竞赛第一名的求解器 -Propositional logic solver, in 2004 the first race of the SAT solver
dnl4451
- *.Sat file format for read/writen ACIS files
satproblem
- 自己编写的，SAT问题的Johnson算法源代码，请多多指教-I have written, SAT question of the Johnson algorithm source code, please advice
mmi
- 手机mmi状态机，包括打电话、发短信、SAT-State machine of mmi of mobilephone, it s including Call, SMS, SAT etc.
sat
- 可满足性问题（SAT),NP完全问题 并行算法 MPI-satisfiability problem(SAT) MPI,NP PROBLEM
SBML-SAT-v1.1
- SBML-SAT is a Systems Biology Markup Language (SBML) based Sensitivity Analysis Tool
GA
- C++ implementation of a Genetic algorithm (GA). A population of binary chromosomes is generated randomly to attempt to solve the Weighted MAX SAT Problem. Parameters of crossover, mutation, population size can be controlled via macros in code.There a
SAT-B55
- Sony SAT-B55 service manual
sat
- Reference for creating ACIS SAT File format
sat
- SAT问题也称为合取范式的可满足问题，一个合取范式形如：A1∧A2∧…∧An，子句Ai（1≤i≤n）形如：a1∨a2∨…∨ak，其中，ai称为文字，为某一布尔变量或该布尔变量的非。SAT问题是指：是否存在一组对所有布尔变量的赋值（TRUE或FALSE），使得整个合取范式取值为真。-SAT problem is also known as conjunctive normal form satisfiability problem, a conjunctive normal form: A1 ∧
sat-file-structure-based-on-acis
- acis sat 文件格式说明，对于三维cad开发十分有用-acis sat file format descr iption is useful for the development of three-dimensional cad
2-sat
- 可以解决2-sat问题，时间复杂度最坏的情况下是n*n-Can solve the 2-sat problem, time complexity worst case is n* n
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
SAT-4 - Rev 6
- SCSI/ATA Translation SAT-4 - Rev 6