Results 171 to 180 of about 133,374 (215)

GRiNS: a python library for simulating gene regulatory network dynamics. [PDF]

BMC Bioinformatics
Harlapur P, Bv H, Jolly MK.
europepmc   +1 more source

Monitoring and predicting cotton leaf diseases using deep learning approaches and mathematical models. [PDF]

Sci Rep
Rehman A, Akhtar N, Alhazmi OH.
europepmc   +1 more source

Machine Learning on Low-Cost Edge Devices for Real-Time Water Quality Prediction in Tilapia Aquaculture. [PDF]

Sensors (Basel)
Nuangpirom P, Pitjamit S, Jaikampan V, Peerakam C, Nakkiew W, Jewpanya P.   +5 more
europepmc   +1 more source

Taskblaster: a generic framework for automated computational workflows.

Digit Discov
Larsen AH, Kuisma MJ, Boland TM, Nilsson FA, Thygesen KS.   +4 more
europepmc   +1 more source

Harnessing DNA computing and nanopore decoding for practical applications: from informatics to microRNA-targeting diagnostics.

Chem Soc Rev
Takiguchi S, Takeuchi N, Shenshin V, Gines G, Genot AJ, Nivala J, Rondelez Y, Kawano R.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Quantified Computation Tree Logic

Information Processing Letters, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anirban Dasgupta, Indrajit Bhattacharya, Anindya C. Patthak, Partha Chakrabarti, Pallab Dasgupta   +4 more
openaire   +3 more sources

Analysing scientific workflows with Computational Tree Logic [PDF]

Cluster Computing, 2009
Motivated by the widespread use of workflow systems in e-Science applications, this article introduces a formal analysis framework for the verification and profiling of the control flow aspects of scientific workflows. The framework relies on process algebras that characterise each workflow component with a process behaviour, which is then used to ...
Curcin, Vasa, Ghanem, Moustafa M., Guo, Yike   +2 more
openaire   +2 more sources

Paraconsistent Computation Tree Logic

New Generation Computing, 2011
It is known that paraconsistent logical systems are more appropriate for inconsistency-tolerant and uncertainty reasoning than other types of logical systems. In this paper, a paraconsistent computation tree logic, PCTL, is obtained by adding paraconsistent negation to the standard computation tree logic CTL. PCTL can be used to appropriately formalize
Norihiro Kamide, Ken Kaneiwa
openaire   +1 more source

A Visual Formalism for Computational Tree Logic

Journal of Visual Languages & Computing, 1999
The recent advances in computer graphics and multimedia technology provide new means for the visualization of abstract information spaces through the use of multi-dimensional and multi-modal communication channels. In the context of computer-aided verification, this potential can be effectively employed to provide visual notations for mathematical ...
A. Del Bimbo, Enrico Vicario
openaire   +2 more sources