خط مشی دسترسیدرباره ما
ثبت نامثبت نام
راهنماراهنما
فارسی
ورودورود
صفحه اصلیصفحه اصلی
جستجوی مدارک
تمام متن
منابع دیجیتالی
رکورد قبلیرکورد بعدی
Document Type : Latin Dissertation
Language of Document : English
Record Number : 149664
Doc. No : ET21456
Main Entry : Lintao Zhang
Title Proper : SEARCHING FOR TRUTH: TECHNIQUES FOR SATISFIABILITY OF BOOLEAN FORMULAS
Note : This document is digital این مدرک بصورت الکترونیکی می باشد
Abstract : The problem of determining whether a propositional Boolean formula can be tme iscalled the Boolean Satisfiability Problem or S-4T. S-4T is an important and widelystudied problem in computer science. In practice, SAT is a core problem in manyapplications such as Electronic Design Automation (EDA) and Artificial Intelligence(A1). This thesis investigates various problems in the design and implementation ofS.4T solvers.Even though researchers have been studying SAT solving algorithms for a longtime, efforts were mainly concentrated on improving the algorithms to prune searchspaces. In this thesis, the implementation issues of SAT solvers are studied andsome of the most widelytested for theQ1 PC1 bus cardBoth these projects mere sofixare des elopment efforts tonards contributing to dlfferentaspects of Roboucs and lZ1echatronics projects m the Controls and Roboucs Group..
Subject : Electericl tess
: برق
electronic file name : TL44623.pdf
Title and statement of responsibility and : SEARCHING FOR TRUTH: TECHNIQUES FOR SATISFIABILITY OF BOOLEAN FORMULAS [Thesis]
 
 
 
(در صورت عدم وضوح تصویر اینجا را کلیک نمایید)