搜索资源列表
sp-1.4
- 人工智能的一个重要方法，随机SAT问题，即一种复杂的组合优化方法，算法清晰，简单，易懂，但涉及较深的数学知识，（该源码基于linux平台的C程序）
walksat-dist
- 解决SAT问题的经典WalkSat算法，基于linux平台开发。-Typical WalkSat algorithm designed for solving SAT problem, developed based on Linux platform.
minisat2-070721
- 最新SAT 可满足性问题的求解的C源码，在最近的几次国际比赛中都取得了很好的结果-Compact design SAT solver for conjuctive normal form structure SAT problem. very efficient
MIT_AI_lec_03
- 麻省理工的人工智能讲义第三章 约束满足问题 介绍了各种类型的约束满足问题-AI lecture-3 of MIT talking about Constraint Satisfaction Problems (CSPs)：N-Queens problem；line labelings；Graph coloring；3-SAT； Model-based recognition etc.
SAT-MMAS
- 蚁群算法 课程内容 比较详细 有文档分解 很不错-ACO course content in more detail with documents into a very good
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
3SAT
- GA比起SA ，最大的优势在于对个初始解，而且存在杂交和变异，让SA具有非常强的跳出局部最优解的能力。而且简单通用，健壮性强。但是待定的参数很多，而且计算速度比较慢。选择，杂交，变异算子的选取也很关键。-GA than SA, the biggest advantage of an initial solution, and there is hybridization and mutation, so that SA has a very strong ability to jump out
SA
- 实现一个MAX 3-SAT 问题的解决。采用模拟退火算法。-to implement a max 3-SAT problem optimization algorithm using simulated annealing
seq-sat-sgplan6
- SGPlan6是伊利诺伊大学最新研制的智能规划器，在第5界世界规划大赛中获得次优规划器冠军，使用Linux C++设计，需借助Flex和Bison工具提供对PDDL的编译器功能。-The University of Illinois is the latest development of intelligent planning SGPlan6 to suboptimal planning Champions in the 5th World Planning Competition use
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 ̴
seq-sat-lama
- LAMA规划器是由澳大利亚Griffi th大学在第5界世界规划大赛中提供的最优化规划器，性能优异，可有效解决时间约束等问题。-The LAMA planner is provided by Australia' s Griffith University, in the 5th World Planning Competition optimized planning, performance can be an effective solution to the time c
sat4j-core-v20130525
- sat4j的核心包,在eclipse之下可以用于解决SAT问题。-sat4j core packages, under the eclipse can be used to solve SAT problem.
Blackbox45
- Blackbox是通过将STRIPS的entire说明转换为布尔型满足问题的规划系统，用于解决多种当前满足的引擎，融合了约束满足和图规划技术。 -Blackbox is a planning system that works by converting problems specified in STRIPS notation into Boolean satisfiability problems, and then solving the problems with a varie