搜索资源列表
单片机通讯程序
- 单片机通讯程序,从单片机SAT设备中获得设备状态.-SCM communications procedures, and SCM SAT equipment access to equipment status.
DVB-S421
- Digital Video Broadcasting (DVB) Framing structure, channel coding and modulation for 11/12 GHz satellite services-Digital Video Broadcasting (DVB) Framing structure, channel coding and modulation for 11/12 GHz sat ellite services
SAT4J_JAVA
- Java版的SAT求解器，基于miniSAT-Java version of the SAT solver, based on miniSAT
sat_problem
- 这是算法中关于SAT问题的解决方法,希望对你有帮助,-This the algorithm on the SAT the solution to the problem, and I hope to help you, thank you
lishanshuxue
- 1.这个计算器可用在离散数学的数理逻辑中，纯属工具，随意传播，由java语言实现,解压即可运行，需要按照java环境。可以去这里下载运行环境：http://www.skycn.com/soft/3116.html 2.这个计算器可以计算逻辑表达式的值、对应的真值表、主析取范式、主合取范式。 3.输入表达式时可以在表达式栏中输入，也可用相应的按钮输入，变元只能是PQRST。由于等价连接词无法识别，所以用等号代替，这也是一个无奈的选择。 4.计算前请选择变元个数（默认为3元）并对变元赋值。变元个数最
PKU-PS_3683-2-sat
- 解决3sat经典问题的模板算法，可随问题的文法少做变更即可-the template for 2-SAT
3-SAT
- programa java 3-sat. con geneticos
2-sat
- 2-sat模板，用来求解图的2-sat问题。共有两种算法，速度都很快，空间复杂度也低。-2-sat templates, used to solve the figure 2-sat problem. There were two kind of algorithm, speed, quickly, the space complexity is low also.
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
Omnia-Update-TNT-SAT
- Omnia Update TNT SAT
Dragon_OMNIA-by-Sat-Dz-Team
- Dragon_OMNIA by Sat-Dz Team
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 ̴
SAT
- SAT问题也称为合取范式的可满足问题，一个合取范式形如：A1∧A2∧…∧An，子句Ai（1≤i≤n）形如：a1∨a2∨…∨ak，其中ai为文字，为某一布尔变量或该布尔变量的非。SAT问题是指：是否存在一组对所有布尔变量的赋值（TRUE或FALSE），使得整个合取范式取指为真。-SAT problem, also known as conjunctive normal to meet a conjunctive normal form: A1 ∧ A2 ∧ ... ∧ An clause Ai (
Omnia-Update-TNT-SAT
- Omnia Update TNT SAT
2-sat
- 可以解决2sat问题，时间复杂度最坏的情况下是n*n-Can solve the 2-sat problem, time complexity worst case is n* n-sat问题，时间复杂度最坏的情况下是n*n-Can solve the 2-sat problem, time complexity worst case is n* n
Mang-giam-sat-va-dieu-khien_MC68HC11_RS485
- Du an mang gim sat va dieu khien su dung MC68HC11_RS485. Phan mem ket noi viet bang ngon ngu VB6.
sat-problem
- sat 算法作业 c语言 源代码-sat problem
SAT
- Code for resolving the 3-Sat problem, written in python
SAT
- SAT: A Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks
Desktop
- 用于求解sat可满足性问题，输入一个式子，判断是否始终满足(Solving the satisfiability problem of SAT,Enter a style to judge whether it is always satisfied)