Journal ArticleDOI
Nonconventional computing paradigms in the new millennium: a roundtable
Albert Y. Zomaya,J.A. Anderson,D.B. Fogel,Gerard J. Milburn,Grzegorz Rozenberg +4 more
- Vol. 3, Iss: 6, pp 82-99
TLDR
Computational models based on natural phenomena have gained popularity, and many perceive them to hold the promise for building more powerful massively parallel computers that can provide considerably more computing power than the authors currently have.Abstract:
Computational models based on natural phenomena have gained popularity. Other techniques are more esoteric, such as DNA-based and quantum computation. Many perceive them to hold the promise for building more powerful massively parallel computers that can provide considerably more computing power than we currently have.read more
Citations
More filters
Proceedings ArticleDOI
From an artificial neural network to a stock market day-trading system: A case study on the BM&F BOVESPA
TL;DR: A day-trading system that “translates” the outputs of an artificial neural network into business decisions, pointing out to the investors the best times to trade and make profits, showing to be more accurate and give more return to the investor than the four benchmarks.
Journal ArticleDOI
Solving the mesh-partitioning problem with an ant-colony algorithm
TL;DR: The so-called multilevel ant-colony algorithm, which is a relatively new metaheuristic search technique for solving optimisation problems, was applied and studied, and the possible parallelisation of this algorithm is discussed.
Journal ArticleDOI
Sequential and parallel cellular automata-based scheduling algorithms
TL;DR: An approach to designing cellular automata-based multiprocessor scheduling algorithms in which extracting knowledge about the scheduling process occurs is presented, and a generic definition of program graph neighborhood is proposed, transparent to the various kinds, sizes, and shapes of program graphs.
Proceedings ArticleDOI
Quantum computing in power system simulation
D.J. Tylavsky,G.T. Heydt +1 more
TL;DR: The basis of quantum computing, its strengths, weaknesses, and challenges are outlined, and the specific application to electric power engineering is discussed.
Journal ArticleDOI
Corrigendum: Solving the mesh-partitioning problem with an ant-colony algorithm [Parallel Computing 30 (2004) 785-801]
TL;DR: The so-called multilevel ant-colony algorithm, which is a relatively new metaheuristic search technique for solving optimisation problems, was applied and studied, and the possible parallelisation of this algorithm is discussed.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
Journal ArticleDOI
A logical calculus of the ideas immanent in nervous activity
Warren S. McCulloch,Walter Pitts +1 more
TL;DR: In this article, it is shown that many particular choices among possible neurophysiological assumptions are equivalent, in the sense that for every net behaving under one assumption, there exists another net which behaves under another and gives the same results, although perhaps not in the same time.
Journal ArticleDOI
No free lunch theorems for optimization
TL;DR: A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving and a number of "no free lunch" (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset by performance over another class.
Journal ArticleDOI
On Computable Numbers, with an Application to the Entscheidungsproblem
TL;DR: This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.