This paper first introduces some widely used CAD model data formats,then analyses the structure of ACIS SAT file.

文中首先對(duì)各種常用的CAD模型數(shù)據(jù)格式進(jìn)行了介紹,著重分析了ACIS SAT文件的結(jié)構(gòu),并對(duì)SAT文件、非SAT文件的讀寫(xiě)以及模型實(shí)體的各種屬性管理進(jìn)行了詳細(xì)闡述,提出了ACIS數(shù)據(jù)文件中模型管理的接口化模式。

Quantum cooperative immune algorithm for SAT problems

量子協(xié)同免疫算法用于SAT問(wèn)題的求解

Due to the complexity of the SAT problem, the speed of solving the SAT problem with software method is very slow.

針對(duì)SAT問(wèn)題的復(fù)雜性及求解速度緩慢的問(wèn)題,采用可重構(gòu)器件FPGA設(shè)計(jì),實(shí)現(xiàn)了靜態(tài)回溯搜索算法SAT問(wèn)題并行處理器,提出了研制動(dòng)態(tài)SAT并行處理器的設(shè)想。

A novel algorithm,SAT-SAGA,is proposed for solving SAT problems based on the combination of the genetic algorithm and simulated annealing algorithm.

提出一種將遺傳算法與模擬退火算法相結(jié)合的SAT問(wèn)題求解算法SAT-SAGA。

A New Method for Solving 3-SAT Problems;

一種求解3-SAT問(wèn)題的新方法

A genetic algorithms for 3-SAT problem determinant

基于遺傳算法的3-SAT問(wèn)題判定

Finaly,the 3-SAT problem be solved by DNA computing method.

本文根據(jù)DNA分子的結(jié)構(gòu)及特點(diǎn)給出了DNA分子的形式化描述,介紹了DNA粘接計(jì)算模型的文法結(jié)構(gòu)和計(jì)算能力,并應(yīng)用DNA計(jì)算方法求解3-SAT問(wèn)題。

MULTI-STAGE SEARCH REARRANGEMENT ALGORITHM FOR SOLVING SAT PROBLEM

求解SAT問(wèn)題的分級(jí)重排搜索算法

Seif-Assembly Algorithm of 3-SAT in DNA Computing;

DNA計(jì)算中的3-SAT問(wèn)題的自裝配算法

Linear Semidefinite Programming Algorithm for SAT Problem

求解SAT問(wèn)題的線(xiàn)性半定規(guī)劃算法

A genetic algorithms for 3-SAT problem determinant

基于遺傳算法的3-SAT問(wèn)題判定

Quantum cooperative immune algorithm for SAT problems

量子協(xié)同免疫算法用于SAT問(wèn)題的求解

A improved algorithm for Solving weighted MAX-SAT problems

一個(gè)求解加權(quán)MAX-SAT問(wèn)題的改進(jìn)算法

3- SAT Problem Code design and Result of the Evaluation Function;

3-SAT問(wèn)題的編碼設(shè)計(jì)及評(píng)估函數(shù)值的求解

Genetic Algorithm and Discrete Particle Swarm Algorithm in the Application of SAT Problem

遺傳算法與離散粒子群算法在SAT問(wèn)題上的應(yīng)用

An Evolutionary Algorithm for Solving SAT Problems Based on Learning CNF Weights

基于CNF權(quán)重學(xué)習(xí)求解3-SAT問(wèn)題的進(jìn)化算法

The satisfiability problem of conjunction normal form (abbreviate SAT problem) is an NP_complete problem.

合取范式可滿(mǎn)足性問(wèn)題(簡(jiǎn)稱(chēng)SAT問(wèn)題)是一個(gè)NP完全問(wèn)題。

GA Solution of 3-SAT based on Clustering Ranking Selection

基于聚類(lèi)排序選擇方法求解3-SAT問(wèn)題的遺傳算法

Research and Implementation of an All-Solution SAT Solver

對(duì)可滿(mǎn)足性（SAT）問(wèn)題求全解的算法研究及實(shí)現(xiàn)

But the SAT folks have added a single question, to be answered in an essay, hand-written on the spot.

但SAT當(dāng)局加了一個(gè)問(wèn)題，這種題目是要以論文寫(xiě)作方式回答，而且要當(dāng)場(chǎng)用手寫(xiě)。

I was never tutored in anything and walked into the SATs without having seen a sample SAT question.

我從沒(méi)有過(guò)任何輔導(dǎo)，是沒(méi)有看過(guò)一道模擬SAT題走進(jìn)考場(chǎng)。

Equivalence of PTAS Reduction for MAX-k-SAT

MAX-k-SAT的PTAS歸約等價(jià)性

The Bounds of Critical Function for (k,s)-SAT;

關(guān)于（k，s）-SAT臨界函數(shù)上下界的研究

Research of the #SAT Approximate Solvers Based on Extension Rule;

基于擴(kuò)展規(guī)則的#SAT近似求解器的研究

Study on the Formal Verification Methods in BDD and SAT;

基于BDD和SAT的形式驗(yàn)證方法的研究