Results 271 to 280 of about 283,589 (317)
Some of the next articles are maybe not open access.
A Deterministic Finite Automaton for Faster Protein Hit Detection in BLAST
Journal of Computational Biology, 2006BLAST is the most popular bioinformatics tool and is used to run millions of queries each day. However, evaluating such queries is slow, taking typically minutes on modern workstations. Therefore, continuing evolution of BLAST--by improving its algorithms and optimizations--is essential to improve search times in the face of exponentially increasing ...
Michael, Cameron +2 more
openaire +3 more sources
Cellular-automaton model of earthquakes with deterministic dynamics
Physical Review A, 1990A cellular-automaton model of threshold elements with deterministic dynamics is introduced. The model is a cellular-automaton version of the mechanical earthquake model invented originally by Burridge and Knopoff [Bull. Seismol. Soc. Am. 57, 341 (1967)] and studied recently by Carlson and Langer [Phys. Rev. Lett. 62, 2632 (1989); Phys. Rev. A 40, 6470 (
openaire +2 more sources
Multimedia learning machine based on non-deterministic finite automaton
2010 2nd International Conference on Computer Engineering and Technology, 2010With the increasing international communications, people are eager to learn foreign languages. As an auxiliary tool, multimedia learning machine (MLM) is welcomed by foreign language learners. So, it is very necessary to design a powerful MLM efficiently. How to deal with the state transition of MLM's different states is a key issue.
Wei-feng Shan, Ji-lin Feng
openaire +1 more source
Block transformations of one-dimensional deterministic cellular automaton rules
Journal of Physics A: Mathematical and General, 1991Given a one-dimensional cellular automaton rule f, a block transform of f is a rule Tbf such that there exists between the limit sets of both rules a bijection that replaces each site value x in a configuration belonging to the limit set of f with a string xb=xx. . .x of length b in the corresponding configuration belonging to the limit set of Tbf.
N Boccara, M Roger
openaire +1 more source
International Cross-Domain Conference on Machine Learning and Knowledge Extraction, 2020
Despite the fact that deep reinforcement learning (RL) has surpassed human-level performances in various tasks, it still has several fundamental challenges such as extensive data requirement and lack of interpretability.
Zhe Xu, Bo Wu, D. Neider, U. Topcu
semanticscholar +1 more source
Despite the fact that deep reinforcement learning (RL) has surpassed human-level performances in various tasks, it still has several fundamental challenges such as extensive data requirement and lack of interpretability.
Zhe Xu, Bo Wu, D. Neider, U. Topcu
semanticscholar +1 more source
Graph exploration by a deterministic memoryless automaton with pebbles
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Debasish Pattanayak, Andrzej Pelc
openaire +1 more source
Learning Deterministic Multi-Clock Timed Automata
International Conference on Hybrid Systems: Computation and ControlWe present an algorithm for active learning of deterministic timed automata with multiple clocks. The algorithm is within the querying framework of Angluin’s L* algorithm and follows the idea proposed in existing work on the active learning of ...
Yu Teng, Miaomiao Zhang, Jie An
semanticscholar +1 more source
Using non-deterministic finite automaton to research intrusion tolerant system
2009 3rd International Conference on Anti-counterfeiting, Security, and Identification in Communication, 2009Intrusion Tolerant is a new network information security technology after firewall, access control and intrusion detection. When a network system is attacked by illegal intrusion, intrusion tolerant system is capable of self-diagnosing, recovering, reconstruction and continuing to provide service to legitimate clients in the presence of intrusions.
null Cuicui Zhang, null Xiaoyao Xie
openaire +1 more source
Bin packing problem solution through a deterministic weighted finite automaton
AIP Conference Proceedings, 2016In this article the solution of Bin Packing problem of one dimension through a weighted finite automaton is presented. Construction of the automaton and its application to solve three different instances, one synthetic data and two benchmarks are presented: N1C1W1_A.BPP belonging to data set Set_1; and BPP13.BPP belonging to hard28.
J. C. Zavala-Díaz +4 more
openaire +1 more source
Completely deterministic self-organized critical state of sandpile automaton models
Physics Letters A, 1991Abstract We study the general Abelian sandpile cellular automaton model of self-organized criticality in which the toppling conditions depend on the local height. We find that under some special kind of toppling rules, the self-organized critical states become completely deterministic, that is, the evolution of the system depends only on the total ...
Cheng, KS, Chau, HF
openaire +2 more sources