Eugene Eberbach

According to our database1, Eugene Eberbach authored at least 55 papers between 1984 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



Learning network flow based on rough set flow graphs and ACO clustering in distributed cognitive environments.
Proceedings of the 1st International Workshop on Software Engineering for Cognitive Services, 2018

On Hypercomputation, Universal and Diagonalization Complete Problems.
Fundam. Informaticae, 2015

Toward El Dorado for Cloud Computing: Lightweight VMs, Containers, Meta-Containers and Oracles.
Proceedings of the 2015 European Conference on Software Architecture Workshops, 2015

Cloud Computing with DNA Cognitive Architecture in the Context of Turing's "Unsinkable" Titanic Machine.
Proceedings of the 2014 IEEE 23rd International WETICE Conference, 2014

A Uniform Problem Solving in the Cognitive Algebra of Bounded Rational Agents.
Proceedings of the Agent and Multi-Agent Systems: Technologies and Applications, 2014

Recursively Generated Evolutionary Turing Machines and Evolutionary Automata.
Proceedings of the Artificial Intelligence, Evolutionary Computing and Metaheuristics, 2013

Ubiquity symposium: Evolutionary computation and the processes of life: perspectives and reality of evolutionary computation: closing statement.
Ubiquity, 2013

Evolutionary Turing in the Context of Evolutionary Machines
CoRR, 2013

Ubiquity symposium: Evolutionary computation and the processes of life: opening statement.
Ubiquity, 2012

Perhaps the Rigorous Modeling of Economic Phenomena Requires Hypercomputation.
Int. J. Unconv. Comput., 2012

Evolutionary Automata: Expressiveness and Convergence of Evolutionary Computation.
Comput. J., 2012

Computing Models for Distributed Autonomic Clouds and Grids in the Context of the DIME Network Architecture.
Proceedings of the 21st IEEE International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2012

Computational Completeness of Interaction Machines and Turing Machines.
Proceedings of the Turing-100, 2012

Bounded and periodic evolutionary machines.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms.
Fundam. Informaticae, 2009

Evolutionary automata as foundation of evolutionary computation: Larry Fogel was right.
Proceedings of the IEEE Congress on Evolutionary Computation, 2009

Approximate reasoning in the algebra of bounded rational agents.
Int. J. Approx. Reason., 2008

Cooperative combinatorial optimization: Evolutionary computation case study.
Biosyst., 2008

The $-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems.
Theor. Comput. Sci., 2007

Toward a Theory of Problem Solving Based on Resource Bounded Computation and Process Algebras.
Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications, 2007

Theoretical Framework for Cooperation and Competition in Evolutionary Computation.
Proceedings of the ICSOFT 2007, 2007

Evolution of evolution: Self-constructing Evolutionary Turing Machine case study.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

Evolutionary Optimization in an Algorithmic Setting
CoRR, 2006

Expresiveness of the pi-Calculus and the $-Calculus.
Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

$-Calculus of Bounded Rational Agents: Flexible Optimization as Search under Bounded Resources in Interactive Systems.
Fundam. Informaticae, 2005

Decision Theory = Performance Measure Theory + Uncertainty Theory.
Proceedings of the Rough Sets, 2005

The $-Calculus Process Algebra for Problem Solving and its Support for Bioinformatics.
Proceedings of the 2nd Indian International Conference on Artificial Intelligence, 2005

The role of completeness in convergence of evolutionary algorithms.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005

New Models of Computation.
Comput. J., 2004

On designing CO$T: a new approach and programming environment for distributed problem solving based on evolutionary computation and anytime algorithms.
Proceedings of the IEEE Congress on Evolutionary Computation, 2004

Beyond Turing Machines.
Bull. EATCS, 2003

Anytime Algorithm for Feature Selection.
Proceedings of the Rough Sets and Current Trends in Computing, 2000

Expressiveness of $-Calculus: What Matters?
Proceedings of the Intelligent Information Systems, 2000

Generalized Mutual Exclusion with Semaphores Only.
Fundam. Informaticae, 1999

Flexible Optimization and Evolution of Underwater Autonomous Agents.
Proceedings of the New Directions in Rough Sets, 1999

SAMON: Communication, Cooperation and Learning of Mobile Autonomous Robotic Agents.
Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence, 1999

Coordination of Engineering Design Agents for High Assurance in Complex Dynamic System Design.
Proceedings of the 3rd IEEE International Symposium on High-Assurance Systems Engineering (HASE '98), 1998

A Generic Tool for Distributed AI with Matching as Message Passing.
Proceedings of the 9th International Conference on Tools with Artificial Intelligence, 1997

A self-modifiable approach to scheduling and mapping algorithms in multiprocessor systems.
Int. J. Comput. Math., 1996

Dynamical Implementation of Nondeterministic Automata and Concurrent Systems.
Proceedings of the Automata Implementation, 1996

Language Support for Concurrent Symbolic and Numeric Systems.
Softw. Concepts Tools, 1994

CSA: In the Direction of Greater Representational Power for Neurocomputing.
J. Parallel Distributed Comput., 1994

Semal: a Cost Language Based on the Calculus of Self-Modifiable Algorithms.
Int. J. Softw. Eng. Knowl. Eng., 1994

The Calculus of Self-Modifiable Algorithm Based Evolutionary Computer Network Routing.
Proceedings of the Process in Evolutionary Computation, 1994

Neural networks and adaptive expert systems in the CSA approach.
Int. J. Intell. Syst., 1993

The Design and Specification of SEMAL - A Cost Language Based on the Calculus of Self-Modifiable Algorithms.
Proceedings of the SEKE'93, 1993

The CSA Approach to Knowledge Representation in Neural Networks.
Proceedings of the Computing and Information, 1993

A CSA-based Robot Plan Generator.
Proceedings of the ACM 21th Conference on Computer Science, 1993

Representing Spatial and Temporal Uncertainty.
Proceedings of the IPMU '92, 1992

Neural Network Processing Elements as a New Generation of "Flip-Flops".
Proceedings of the Advances in Computing and Information, 1991

CSA: two paradigms of the language for adaptive expert systems.
Proceedings of the 19th annual conference on Computer Science, 1991

Selected Aspects of the Calculus of Self-Modifiable Algorithms Theory.
Proceedings of the Advances in Computing and Information, 1990

PARLE: A Parallel Target Language for Integrating Symbolic and Numeric Processing.
Proceedings of the PARLE '89: Parallel Architectures and Languages Europe, 1989

Analysis and Synthesis of Fault-tolerant Distributed Computer Systems.
J. Inf. Process. Cybern., 1986

An uniform approach to the operating system in fault-tolerant distributed computer systems.
Proceedings of the Fehlertolerierende Rechensysteme, 1984