default search action
Eugene Eberbach
Person information
- affiliation: Rensselaer Polytechnic Institute, Troy, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j21]Eugene Eberbach:
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus. Fundam. Informaticae 188(2): 63-90 (2022) - 2021
- [i3]Eugene Eberbach:
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus. CoRR abs/2106.15969 (2021)
2010 – 2019
- 2018
- [c36]Arkadiusz Lewicki
, Eugene Eberbach
Learning network flow based on rough set flow graphs and ACO clustering in distributed cognitive environments. SE4COG@ICSE 2018: 18-24 - 2015
- [j20]Eugene Eberbach
On Hypercomputation, Universal and Diagonalization Complete Problems. Fundam. Informaticae 139(4): 329-346 (2015) - [c35]Eugene Eberbach
Toward El Dorado for Cloud Computing: Lightweight VMs, Containers, Meta-Containers and Oracles. ECSA Workshops 2015: 13:1-13:7 - 2014
- [c34]Eugene Eberbach
A Uniform Problem Solving in the Cognitive Algebra of Bounded Rational Agents. KES-AMSTA 2014: 117-126 - [c33]Eugene Eberbach
Cloud Computing with DNA Cognitive Architecture in the Context of Turing's "Unsinkable" Titanic Machine. WETICE 2014: 125-130 - 2013
- [j19]Mark Burgin, Eugene Eberbach:
Ubiquity symposium: Evolutionary computation and the processes of life: perspectives and reality of evolutionary computation: closing statement. Ubiquity 2013(December): 5:1-5:12 (2013) - [p1]Mark Burgin, Eugene Eberbach
Recursively Generated Evolutionary Turing Machines and Evolutionary Automata. Artificial Intelligence, Evolutionary Computing and Metaheuristics 2013: 201-230 - [i2]Mark Burgin, Eugene Eberbach:
Evolutionary Turing in the Context of Evolutionary Machines. CoRR abs/1304.3762 (2013) - 2012
- [j18]Mark Burgin, Eugene Eberbach
Evolutionary Automata: Expressiveness and Convergence of Evolutionary Computation. Comput. J. 55(9): 1023-1029 (2012) - [j17]Selmer Bringsjord, Naveen Sundar G., Eugene Eberbach, Yingrui Yang:
Perhaps the Rigorous Modeling of Economic Phenomena Requires Hypercomputation. Int. J. Unconv. Comput. 8(1): 3-32 (2012) - [j16]Mark Burgin, Eugene Eberbach:
Ubiquity symposium: Evolutionary computation and the processes of life: opening statement. Ubiquity 2012(August): 1:1-1:13 (2012) - [c32]Peter Wegner, Eugene Eberbach, Mark Burgin:
Computational Completeness of Interaction Machines and Turing Machines. Turing-100 2012: 405-414 - [c31]Eugene Eberbach
Computing Models for Distributed Autonomic Clouds and Grids in the Context of the DIME Network Architecture. WETICE 2012: 125-130 - 2010
- [c30]Mark Burgin, Eugene Eberbach
Bounded and periodic evolutionary machines. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2009
- [j15]Mark Burgin, Eugene Eberbach
Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms. Fundam. Informaticae 91(1): 53-77 (2009) - [c29]Eugene Eberbach
Evolutionary automata as foundation of evolutionary computation: Larry Fogel was right. IEEE Congress on Evolutionary Computation 2009: 2149-2156 - 2008
- [j14]Mark Burgin, Eugene Eberbach
Cooperative combinatorial optimization: Evolutionary computation case study. Biosyst. 91(1): 34-50 (2008) - [j13]Eugene Eberbach
Approximate reasoning in the algebra of bounded rational agents. Int. J. Approx. Reason. 49(2): 316-330 (2008) - 2007
- [j12]Eugene Eberbach
The $-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems. Theor. Comput. Sci. 383(2-3): 200-243 (2007) - [c28]Eugene Eberbach
Evolution of evolution: Self-constructing Evolutionary Turing Machine case study. IEEE Congress on Evolutionary Computation 2007: 4599-4605 - [c27]Eugene Eberbach, Mark Burgin:
Theoretical Framework for Cooperation and Competition in Evolutionary Computation. ICSOFT (PL/DPS/KE/MUSE) 2007: 229-234 - [c26]Eugene Eberbach:
Toward a Theory of Problem Solving Based on Resource Bounded Computation and Process Algebras. ISDA 2007: 3-8 - 2006
- [c25]Eugene Eberbach:
Expresiveness of the pi-Calculus and the $-Calculus. FCS 2006: 24-30 - [i1]Mark Burgin, Eugene Eberbach:
Evolutionary Optimization in an Algorithmic Setting. CoRR abs/cs/0611077 (2006) - 2005
- [j11]Eugene Eberbach:
$-Calculus of Bounded Rational Agents: Flexible Optimization as Search under Bounded Resources in Interactive Systems. Fundam. Informaticae 68(1-2): 47-102 (2005) - [c24]Eugene Eberbach:
The role of completeness in convergence of evolutionary algorithms. Congress on Evolutionary Computation 2005: 1706-1713 - [c23]Lara Atallah, Eugene Eberbach:
The $-Calculus Process Algebra for Problem Solving and its Support for Bioinformatics. IICAI 2005: 1547-1564 - [c22]Eugene Eberbach
Decision Theory = Performance Measure Theory + Uncertainty Theory. RSFDGrC (1) 2005: 551-560 - 2004
- [j10]Peter Wegner, Eugene Eberbach
New Models of Computation. Comput. J. 47(1): 4-9 (2004) - [c21]Eugene Eberbach, Andrew Eberbach:
On designing CO$T: a new approach and programming environment for distributed problem solving based on evolutionary computation and anytime algorithms. IEEE Congress on Evolutionary Computation 2004: 1836-1843 - 2003
- [j9]Eugene Eberbach, Peter Wegner:
Beyond Turing Machines. Bull. EATCS 81: 279-304 (2003) - [c20]Eugene Eberbach
On the connection between the no free lunch theorem and the trivial property for recursively enumerable languages. IEEE Congress on Evolutionary Computation 2003: 2611-2618 - 2002
- [c19]Eugene Eberbach
On expressiveness of evolutionary computation: is EC algorithmic? IEEE Congress on Evolutionary Computation 2002: 564-569 - 2001
- [c18]Eugene Eberbach:
Evolutionary computation as a multi-agent search: a -calculus perspective for its completeness and optimality. CEC 2001: 823-830 - 2000
- [c17]Eugene Eberbach:
Expressiveness of $-Calculus: What Matters? Intelligent Information Systems 2000: 145-157 - [c16]Mark Last, Abraham Kandel, Oded Maimon, Eugene Eberbach
Anytime Algorithm for Feature Selection. Rough Sets and Current Trends in Computing 2000: 532-539
1990 – 1999
- 1999
- [j8]Edward T. Ordman, Eugene Eberbach
Generalized Mutual Exclusion with Semaphores Only. Fundam. Informaticae 40(4): 407-422 (1999) - [c15]Eugene Eberbach, Shashi Phoha:
SAMON: Communication, Cooperation and Learning of Mobile Autonomous Robotic Agents. ICTAI 1999: 229-236 - [c14]Eugene Eberbach
Flexible Optimization and Evolution of Underwater Autonomous Agents. RSFDGrC 1999: 519-527 - 1998
- [c13]Shashi Phoha, Eugene Eberbach
Coordination of Engineering Design Agents for High Assurance in Complex Dynamic System Design. HASE 1998: 296-303 - 1997
- [c12]Eugene Eberbach:
A Generic Tool for Distributed AI with Matching as Message Passing. ICTAI 1997: 11-18 - 1996
- [j7]Eugeniusz Eberbach
A self-modifiable approach to scheduling and mapping algorithms in multiprocessor systems. Int. J. Comput. Math. 59(3-4): 131-150 (1996) - [c11]Max H. Garzon, Eugene Eberbach
Dynamical Implementation of Nondeterministic Automata and Concurrent Systems. Workshop on Implementing Automata 1996: 35-49 - 1994
- [j6]Eugeniusz Eberbach:
Semal: a Cost Language Based on the Calculus of Self-Modifiable Algorithms. Int. J. Softw. Eng. Knowl. Eng. 4(3): 391-408 (1994) - [j5]Eugeniusz Eberbach
CSA: In the Direction of Greater Representational Power for Neurocomputing. J. Parallel Distributed Comput. 22(1): 107-112 (1994) - [j4]John Yiannis Cotronis, Apostolos Nikolaos Refenes, Eugene Eberbach:
Language Support for Concurrent Symbolic and Numeric Systems. Softw. Concepts Tools 15(3): 105-124 (1994) - [c10]Davika Seunarine, Eugeniusz Eberbach
The Calculus of Self-Modifiable Algorithm Based Evolutionary Computer Network Routing. Evo Workshops 1994: 201-224 - 1993
- [j3]Eugeniusz Eberbach
Neural networks and adaptive expert systems in the CSA approach. Int. J. Intell. Syst. 8(4): 569-602 (1993) - [c9]Van King Tan, Eugeniusz Eberbach:
A CSA-based Robot Plan Generator. ACM Conference on Computer Science 1993: 115-123 - [c8]Eugeniusz Eberbach, Piotr W. Prószynski:
The CSA Approach to Knowledge Representation in Neural Networks. ICCI 1993: 327-331 - [c7]Eugeniusz Eberbach:
The Design and Specification of SEMAL - A Cost Language Based on the Calculus of Self-Modifiable Algorithms. SEKE 1993: 166-173 - 1992
- [c6]Eugene Eberbach
Representing Spatial and Temporal Uncertainty. IPMU 1992: 129-138 - 1991
- [c5]Eugeniusz Eberbach
CSA: two paradigms of the language for adaptive expert systems. ACM Conference on Computer Science 1991: 570-581 - [c4]Eugeniusz Eberbach
Neural Network Processing Elements as a New Generation of "Flip-Flops". ICCI 1991: 687-698 - 1990
- [c3]Eugeniusz Eberbach
Selected Aspects of the Calculus of Self-Modifiable Algorithms Theory. ICCI 1990: 34-43
1980 – 1989
- 1989
- [j2]Eugeniusz Eberbach
PARLE: A language for expressing parallelism and integrating symbolic and numeric computations. Microprocessing and Microprogramming 27(1-5): 207-214 (1989) - [c2]Apostolos Nikolaos Refenes, Eugene Eberbach
PARLE: A Parallel Target Language for Integrating Symbolic and Numeric Processing. PARLE (2) 1989: 181-198 - 1986
- [j1]Eugeniusz Eberbach, Jan R. Just:
Analysis and Synthesis of Fault-tolerant Distributed Computer Systems. J. Inf. Process. Cybern. 22(7/8): 385-409 (1986) - 1984
- [c1]Eugeniusz Eberbach, Jan R. Just:
An uniform approach to the operating system in fault-tolerant distributed computer systems. Fehlertolerierende Rechensysteme 1984: 150-163
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: