458 Hits in 5.0 sec

Page 3613 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
Markova, The cellular Knuth algorithm for complex number multiplication (91-98); Martin Kutrib and Thomas Worsch, Investigation of different input modes for cellular automata (141-150); Octav Brudaru and  ...  Orlin, A faster algorithm for finding the minimum cut in a directed graph (424-446); V. King [Valerie King], S. Rao [Satish B. Rao] and R.  ... 

Page 759 of Mathematical Reviews Vol. , Issue 83b [page]

1983 Mathematical Reviews  
Authors’ summary: “We propose three parallel algorithms for decomposing a partial finite automaton into a two-component network; the algorithms are based on approximate algorithms for minimizing the number  ...  Results of computer tests are given for two algorithms, programmed in the LYaPAS-M language.” Willson, Stephen J. Growth patterns of ordered cellular automata. J. Comput.  ... 

Page 6654 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
Press, Washington, DC, 1987, see MR 88k:68012] for multiple recursive rule Datalog programs.  ...  Complex Systems 2 (1988), no. 6, 649-661. Summary: “We study cellular automata with additive rules on finite undirected graphs. The addition is carried out in some finite abelian monoid.  ... 

Insertion Sort with Self-reproducing Comparator P System [article]

Davood Pour Yousefian Barfeh and Neil P. Balba and Jaderick P. Pabico
2017 arXiv   pre-print
The comparator Π_c is a degree-2 membrane and structured as μ = [_h_0 [_h_1]_h_1 [_h_2]_h_2 ]_h_0.  ...  A conditional reproduction rule triggers Π_c to clone itself out via compartment division followed by endocytosis of the cloned compartment.  ...  Based on time complexity and number of comparison, insertion sort is as slow as bubble sort is; the worst case and the average case for both of insertion sort and bubble sort is O(n 2 ) while the best  ... 
arXiv:1709.02934v1 fatcat:6mobgvq7fbfhtnalaj3igtwxnm

A Genetic Algorithm tool for optimising cellular or functional layouts in the capital goods industry

Christian Hicks
2006 International Journal of Production Economics  
Genetic Algorithm programs include a number of parameters including the probabilities of crossover and mutation, the population size and the number of generations.  ...  The literature on the design of manufacturing facilities has two major themes: the application of Cellular Manufacturing, including the use of clustering methods; and the solution of facilities layout  ...  The number of generations was the only statistically significant factor and the high level was found to be best.  ... 
doi:10.1016/j.ijpe.2005.03.010 fatcat:6e3vruwrkndffjdq54j5icokv4

Page 2588 of Mathematical Reviews Vol. , Issue 97D [page]

1997 Mathematical Reviews  
The time complexity of each operation is O(logn) (amortized for edge in- sertion), and the memory space and preprocessing time are O(n), where n is the current number of vertices of the graph.” 97d:68168  ...  The algorithm takes O(log’) time with O(n*) processors on a CREW PRAM, where n is the number of vertices of the input graph.  ... 

A novel approach for bit-serial AB2 multiplication in finite fields GF(2m)

Jun-Cheol Jeon, Kee-Won Kim, Kee-Young Yoo
2006 Computers and Mathematics with Applications  
Thus, efficient AB 2 multiplication algorithms and simple architectures are the key to implementing exponentiation.  ...  The proposed bit-serial multiplication algorithm and architecture are highly regular and simpler than those of previous works.  ...  Liu proposed an AB 2 multiplication algorithm using an inner product and parallel twodimensional cellular architecture [9] .  ... 
doi:10.1016/j.camwa.2005.07.019 fatcat:nnzzdnm5fbasrgcl2ael4tivba

Cellular Automaton-Based Pseudorandom Number Generator

Zakarya Zarezadeh
2017 Complex Systems  
This paper is concerned with the study of pseudorandom number generation by an extension of the original cellular automaton, termed nonuniform cellular automata.  ...  By using a standard software package for statistically evaluating the quality of random number sequences known as the Diehard battery test suite and TestU01, the results of the proposed model are validated  ...  Cellular automata were originally conceived in the 1940s to provide a formal framework for investigating the behavior of complex extended systems [7] .  ... 
doi:10.25088/complexsystems.26.4.373 fatcat:7o7hejsgqzfj3fldegcfeen6qu

Programmatic modeling for biological systems [article]

Alexander Lyulph Robert Lubbock, Carlos F Lopez
2021 bioRxiv   pre-print
These models are often constructed using graphical user interfaces or domain- specific languages, with SBML used for interchange.  ...  Computational modeling has become an established technique to encode mathematical representations of cellular processes and gain mechanistic insights that drive testable predictions.  ...  However, signaling pathways often comprise a large number of molecular complexes, which can assemble in multiple orders, leading to a large number of reactions and intermediate species during complex assembly  ... 
doi:10.1101/2021.02.26.433125 fatcat:7mzy4rwg6bdpvf5xf5j53hregi

A taxonomy of parallel sorting

Dina Bitton, David J. DeWitt, David K. Hsaio, Jaishankar Menon
1984 ACM Computing Surveys  
Parallel sorting algorithms are evaluated according to several criteria related to both the time complexity of an algorithm and its feasibility from the viewpoint of computer architecture.  ...  number of other sparse networks.  ...  We have kept to a minimum the discussion on algorithm complexity, and we only describe the main upper-bound results for the number of parallel comparison steps required by the algorithms.  ... 
doi:10.1145/2514.2516 fatcat:dc2bhjocynep5mfp3ntak3cfrq

An Analytical Study of Cellular Automata and its Applications in Cryptography

G. Kumaresan, N.P. Gopalan
2017 International Journal of Computer Network and Information Security  
The implication is: there is a need for efficient methods to secure digital data across different platforms.  ...  The concept of cellular automata finds application in the design of efficient methods to secure digital information.  ...  It is the special class of cellular automata, especially used in genetic algorithm for efficient implementation. Most of the GMACA designed for complex system because, it reduces the space and time.  ... 
doi:10.5815/ijcnis.2017.12.06 fatcat:w5ccl675ejgzdpnqsnzmceggf4

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Peter W. Shor
1997 SIAM journal on computing (Print)  
These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored.  ...  Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer.  ...  Acknowledgements I would like to thank Jeff Lagarias for finding and fixing a critical error in the first version of the discrete log algorithm.  ... 
doi:10.1137/s0097539795293172 fatcat:dkqxk6xhsvamvi2dtrht4rauzq

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Peter W. Shor
1999 SIAM Review  
These algorithms take a n umber of steps polynomial in the input size, e.g., the number of digits of the integer to be factored.  ...  Ecient randomized algorithms are given for these two problems on a hypothetical quantum computer.  ...  Acknowledgements I w ould like to thank Je Lagarias for nding and xing a critical error in the rst version of the discrete log algorithm.  ... 
doi:10.1137/s0036144598347011 fatcat:klt3dk5yxjfsrf7uhwk2cgyjzm

Cellular Automata and Randomization: A Structural Overview [chapter]

Monica Dascălu
2018 From Natural to Artificial Intelligence - Algorithms and Applications  
The chapter overviews the methods, algorithms, and architectures for random number generators based on cellular automata, as presented in the scientific literature.  ...  the complexity and universality of cellular automata.  ...  Acknowledgements I want to thank the editor for the suggestions that very much helped to improve this chapter. Also, I would like to thank Eduard Franti for useful remarks and support.  ... 
doi:10.5772/intechopen.79812 fatcat:enrbvyep55fdnhjxsr23gsqhty

Interactive Multiresolution Visualization of Cellular Network Processes [article]

Oscar O. Ortega, Carlos F Lopez
2019 biorxiv/medrxiv   pre-print
Modern models can span a broad range of biochemical reactions and species that, in principle, comprise the complexity of dynamic cellular processes.  ...  Therefore, PyViPR aids the conceptual understanding of dynamic network processes and accelerates hypothesis generation for further testing and validation.  ...  Community Number Apoptosis Subprocess References Taken together, our results demonstrate that despite multiple parameters fitting the data equally well, apoptosis is executed differently for each parameter  ... 
doi:10.1101/659367 fatcat:bh57bwif2ndavkaz7ut2sxluhi
« Previous Showing results 1 — 15 out of 458 results