Probe Machine Based Computing Model for Solving Satisfiability Problem

2020 ◽  
pp. 79-92
Author(s):  
Jianzhong Cui ◽  
Zhixiang Yin ◽  
Jing Yang ◽  
Xianya Geng ◽  
Qiang Zhang
Keyword(s):  
Satisfiability Problem ◽  
Computing Model

A Biobrick Inversion Cellular Computing Model for Satisfiability Problem

2014 ◽  
Vol 36 (12) ◽  
pp. 2537-2544 ◽  
Author(s):  
Mei CHEN ◽  
Xiang-Qun CHEN ◽  
Lu ZHANG ◽  
Jin Xu
Keyword(s):  
Satisfiability Problem ◽  
Computing Model ◽  
Cellular Computing

DNA Computing Model for Satisfiability Problem Based on Hybridization Chain Reaction

2020 ◽  
pp. 2159010
Author(s):  
Zhixiang Yin ◽  
Jing Yang ◽  
Qiang Zhang ◽  
Zhen Tang ◽  
Guoqiang Wang ◽  
...  
Keyword(s):  
Dna Computing ◽  
Dna Origami ◽  
Satisfiability Problem ◽  
Hybridization Chain Reaction ◽  
Chain Reaction ◽  
Computing Device ◽  
Computing Model ◽  
Novel Method ◽  
Np Complete ◽  
The Given

Satisfiability problem is a famous nondeterministic polynomial-time complete (NP-complete) problem, which has always been a hotspot in artificial intelligence. In this paper, by combining the advantages of DNA origami with hybridization chain reaction, a computing model was proposed to solve the satisfiability problem. For each clause in the given formula, a DNA origami device was devised. The device corresponding to the clause was capable of searching for assignments that satisfied the clause. When all devices completed the search in parallel, the intersection of these satisfying assignments found must satisfy all the clauses. Therefore, whether the given formula is satisfiable or not was decided. The simulation results demonstrated that the proposed computing model was feasible. Our work showed the capability of DNA origami in architecting automatic computing device. The paper proposed a novel method for designing functional nanoscale devices based on DNA origami.

Molecular Beacon Based DNA Computing Model for General Satisfiability Problem

2009 ◽  
Vol 31 (12) ◽  
pp. 2200-2206 ◽  
Author(s):  
Zhi-Xiang YIN ◽  
Jian-Zhong CUI ◽  
Ling-Ying ZHI ◽  
Xia SUN ◽  
Xiao-Hui HUANG
Keyword(s):  
Dna Computing ◽  
Molecular Beacon ◽  
Satisfiability Problem ◽  
Computing Model

A SERVICE FOR SOLVING BOOLEAN SATISFIABILITY PROBLEM USING NVIDIA CUDA TECHNOLOGY

2017 ◽  
Vol 4 (56) ◽  
pp. 107-114
Author(s):  
A. D. Kolosov ◽  
◽  
V. O. Gorovoy ◽  
V. V. Kondratiev ◽  
◽  
...  
Keyword(s):  
Boolean Satisfiability ◽  
Satisfiability Problem ◽  
Boolean Satisfiability Problem ◽  
Nvidia Cuda ◽  
Cuda Technology

Urban Railway Bridge Fast Evaluation Based on Cloud Computing

2011 ◽  
Vol 71-78 ◽  
pp. 4501-4505
Author(s):  
Ming Chen ◽  
Wan Zhou
Keyword(s):  
Neural Networks ◽  
Cloud Computing ◽  
Model Updating ◽  
Condition Assessment ◽  
Fe Model ◽  
Railway Bridge ◽  
Fast Evaluation ◽  
Railway Bridges ◽  
Computing Model ◽  
Bridge Condition Assessment

Although modern bridge are carefully designed and well constructed, damage may occur in them due to unexpected causes. Currently, many different techniques have been proposed and investigated in bridge condition assessment. However, evaluation efficiency of condition assessment has not been paid much attention by the researchers. A fast evaluation of the urban railway bridge condition based on the cloud computing is presented. In this paper dynamic FE model and Artificial neural networks technique is applied to model updating. The cloud computing model provides the basis for fast analyses. It was found that when applied to the actually railway bridges, the proposed method provided results similar to those obtained by experts, but can improve efficiency of bridge

scholarly journals Simplest randomK-satisfiability problem

2001 ◽  
Vol 63 (2) ◽  
Author(s):  
Federico Ricci-Tersenghi ◽  
Martin Weigt ◽  
Riccardo Zecchina
Keyword(s):  
Satisfiability Problem

scholarly journals Soft computing model for students’ evaluation in educational institute

2021 ◽  
Vol 1913 (1) ◽  
pp. 012137
Author(s):  
O K Chaudhari ◽  
Rajshri Gupta ◽  
T A Thakre
Keyword(s):  
Soft Computing ◽  
Computing Model ◽  
Educational Institute

Soft computing model for predicting the wear resistance of friction stir processed aluminum alloy AA5083

2021 ◽  
Author(s):  
K. Santhosh Kumar ◽  
R. Vaira Vignesh ◽  
G. Ajith Kumar ◽  
A. Abiram ◽  
R. Padmanaban
Keyword(s):  
Wear Resistance ◽  
Aluminum Alloy ◽  
Soft Computing ◽  
Friction Stir ◽  
Computing Model
Sign in / Sign up

Export Citation Format

Share Document