Development of an in vivo computer for the SAT problem

被引：1

作者：

Liu, Xiangrong ^{[1
]}

Wang, Shudong ^{[2
]}

机构：

[1] Xiamen Univ, Dept Comp Sci, Sch Informat Sci & Technol, Xiamen 361005, Peoples R China

[2] Shandong Univ Sci & Technol, Coll Informat Sci & Engn, Qingdao 266510, Peoples R China

来源：

MATHEMATICAL AND COMPUTER MODELLING | 2010年 / 52卷 / 11-12期

基金：

中国国家自然科学基金;

关键词：

Biomolecular computing in vivo; Gene network; SAT problem; TRANSCRIPTIONAL ACTIVATION; MOLECULAR COMPUTATION; ESCHERICHIA-COLI; DNA SOLUTION; ELEMENTS; CELLS;

D O I：

10.1016/j.mcm.2010.06.006

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Biomolecular computing models in vivo are emerging computing model inspired by the biological phenomena whereby biochemical molecules in living organisms perform computation, communication, and signal processing collaboratively. In this paper, a biomolecular computing model in vivo for solving the SAT problem is presented. A synthetic gene network is constructed by operon in Escherichia coli. This model explores the ability to solve hard problems based on the organism processing signals. Crown Copyright (C) 2010 Published by Elsevier Ltd. All rights reserved.

引用

页码：2043 / 2047

页数：5

共 50 条

[21] GLOBAL OPTIMIZATION FOR SATISFIABILITY (SAT) PROBLEM
GU, J
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1994, 6 (03) : 361 - 381
[22] A stochastic limit approach to the SAT problem
Accardi, L
Ohya, M
VLSI'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VLSI, 2003, : 208 - 214
[23] A Stochastic limit approach to the SAT problem
Accardi, L
Ohya, M
OPEN SYSTEMS & INFORMATION DYNAMICS, 2004, 11 (03): : 219 - 233
[24] LOCAL SEARCH FOR SATISFIABILITY (SAT) PROBLEM
GU, J
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1993, 23 (04): : 1108 - 1129
[25] A SAT encoding for the portfolio selection problem
di Tollo, Giacomo
Lardeux, Frederic
Pesenti, Raffaele
Petris, Matteo
SOFT COMPUTING, 2023,
[26] A GRASP for the Minimum Cost SAT Problem
Felici, Giovanni
Ferone, Daniele
Festa, Paola
Napoletano, Antonio
Pastore, Tommaso
LEARNING AND INTELLIGENT OPTIMIZATION (LION 11 2017), 2017, 10556 : 64 - 78
[27] An application of matroid theory to the SAT problem
Kullmann, O
15TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 116 - 124
[28] A genetic algorithm for probabilistic SAT problem
Ognjanovic, Z
Midic, U
Kratica, J
ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING - ICAISC 2004, 2004, 3070 : 462 - 467
[29] Development and application of an embedded computer system for CubeSats exemplified by the OPS-SAT space mission
Zeif, Reinhard
Kubicka, Manuel
Hoermer, Andreas Johann
ELEKTROTECHNIK UND INFORMATIONSTECHNIK, 2022, 139 (01): : 8 - 15
[30] A SAT plus Computer Algebra System Verification of the Ramsey Problem R(3,8) (Student Abstract)
Duggan, Conor
Li, Zhengyu
Bright, Curtis
Ganesh, Vijay
THIRTY-EIGTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 21, 2024, : 23480 - 23481

← 1 2 3 4 5 →