On several kinds of space-bounded on-line multicounter automata.
Compiler generation and denotational semantics.
Structured Randomized Rounding and Coloring.
Rewriting Regular Inequalities (Extended Abstract).
On the Complexity of Approximate Realization of Continuous Functions by Schemes and Formulas in Continuous Bases.
Iterated linear control and iterated one-turn pushdowns.
Algebras of Partial Sequences - A Tool to Deal with Concurrency.
Initial Algebraic Semantics for Non Context-Free Languages.
On Two-Sided Infinite Fixed Points of Morphisms.
On a Connection Between the Resolution Method and the Inverse Method.
Optimal Online Flow Time with Resource Augmentation.
Semilinear Real-Time Systolic Trellis Automata.
The oscillation complexity and a hierarchy of context-free languages.
Bounded Set Theory and Polynominal Computability.
Optimal Embedding of a Toroidal Array in a Linear Array.
To the Functional Equivalence of Turing Machines.
A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain.
Polynomial Time Algorithms in the Theory of Linear Diophantine Equations.
Continuous abstract data types: basic machinery and results.
On Word Equations and Makanin's Algorithm.
Degrees of Nondeterminism for Pushdown Automata.
Relational Automata ina Category and their Language.
Machines and their behaviour in a category.
Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases.
Decidability of omaega-Trees with Bounded Sets - A Survey.
Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures.
Tree-partite graphs and the complexity of algorithms.
Linear Automata and Recognizable Subsets in Free Semirings.
2p: Recent Results and Applications in AI and Modal Logic.
A Solving of Problems on Technological Models.
A quadratic regularity test for non-deleting macro S grammars.
On the Finite Degree of Ambiguity of Finite Tree Automata.
Economy of Description for Program Schemes -Extended Abstract-.
Liveness of Weighted Circuits and the Diophantine Problem of Frobenius.
Embedding Theorem in the Algebraic Theory of Graph Grammars.
Rewriting, Möbius Functions and Semi-Commutations.
PRAM's Towards Realistic Parallelism: BRAM's.
Possibilities of Probabilistic on-line Counting Machines.
Axiomatizing Petri Net Concatenable Processes.
Estimation Algorithms of Infinite Graphs Percolation Threshold.
Are lower bounds on the complexity lower bounds for universal circuits.
Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria.
On Oblivious Branching Programs of Linear Length (Extended Abstract).
Lower bounds on the complexity of 1-time only branching programs.
Equivalence Problem of Composite Class Diagrams.
Some Results Concerning Two-Dimensional Turing Machines and Finite Automata.
The Equivalence of Pebbles and Sensing Heads for Finite Automata.
Complexity of the Problem of Approximation of Stochastic Matrix by Rational Elements.
On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars.
An Algebraic Defenition of Attributed Transformations.
Interpretations of Synchronous Flowchart Schemes.
A Simple Abstract Semantics for Equational Theories.
Complexity Gaps of Turing Machines of Infinite Words.
Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms.
A grammatical model for the top-down design of structured programs.
Cones, Semi-AFPs, and AFPs of Algebraic Power Series.
Minimal Numberings of the Vertices of Trees - Approximate Approach.
Stochastic Algebras and Stochastic Automata over General Measurable Spaces: Algebraic Theory and a Decomposition Theory.
From a Concurrent Lambda-Calculus to the Pi-Calculus.
Some ``Geometrical'' Categories Associated with Flowchart Schemes.
Logical Description of Computation Processes.
Growing Patterns in 1D Cellular Automata.
Applicability of a Production in a Categorical Grammar.
Exact Analysis of Three Tree Contraction Algorithms.
Divisibility Monoids: Presentation, Word Problem, and Rational Languages.
A Maximum Path Length Pumping Lemma for Edge-Replacement Languages.
The Power of Nondeterminism in Polynominal-size Bounded-width Branching Programs.
Word problems for groups and contextfree recognition.
A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions.
Approximation Algorithms for Channel Assignment in Cellular Radio Networks.
Random Access Machines and Straight-Line Programs.
Optimal Continguous Expression DAG Evaluations.
Lower Bounds in On-Line Geometric Searching.
On Recognizable Languages in Divisibility Monoids.
On Approximate Solution of the Problem of Equivalent Transformations of Programs.
Prediction-Preserving Reducibility with Membership Queries on Formal Languages.
Functional Behaviour of Nondeterministic Programs.
Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs.
On determinants, matchings, and random algorithms.
Reading Functions and an Extension of Kleene Theorem for some Families of Languages.
Partially-additive semantics: A progress report.
The Equational Theory of a Boolean Monad.
On Checking Correctness of Some Classes of Control Systems.
On the Theory of Syntactic Monoids for Rational Languages.
A unifying theorem for algebraic semantics and dynamic logics.
Easity Checked Self-Reducibility (Extended Abstract).
Henkin-type semantics for program-schemes to turn negative results to positive.
Contextual Grammars with Distributed Catenation and Shuffle.
Nondeterministic Finite Algorithmic Procedures as the Models of Abstract Computability.
Optimal, Distributed Decision-Making: The Case of No Communication.
On the Complexities of Linear LL(1) and LR(1) Grammars.
Fixed-Points and Algebras with Infinitely Long Expressions, II.
A Two-Dimensional Hierarchy for Attributed Tree Transducers.
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey).
Characterizing Composability of Abstract Implementations.
Properties of Probabilistic Pushdown Automata (Extended Abstract).
A General Categorical Connection between Local Event Structures and Local Traces.
The complexity of distributive computations.
The Greedy and Delauney Triangulations are not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-Connected Polygons is NP-Complete.
On the decidability of the theory of free groups (in Russian).
A Polynomial Time Approximation Scheme for Dense MIN 2SAT.
A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract).
An Optimal Adaptive In-place Sorting Algorithm.
Expected Behavior of Graph Coloring Algorithms.
On the Synthesis of "Irredundant" Automata from a Finite Set of Experiments.
The Identification of Propositions and types in Martin-Löf's Type Theory: A Programming Example.
Decision Problems for Exponential Rings: The p-adic case.
What is Computable for Abstract Data Types?
A Characterization of Binary Search Networks.
On Metric Properties of Automata and Epsilon-Approximation of Automaton Mapping.
Undecidability of the Surjectivity Problem for 2D Cellular Automata: A Simplified Proof.
Distributed Catenation and Chomsky Hierarchy.
New Small Universal Circular Post Machines.
Regular Tree Languages Without Unary Symbols are Star-Free.
On the restriction of some NP-complete graph problems to permutation graphs.
Reversal-Bounded and Visit-Bounded Realtime Computations.
On the Communication Complexity of Planarity.
Decidability of Equivalence for Linear Letter to Letter To-down Tree Transducers.
About a Family of Binary Morphisms which Stationary Words are Sturmian.
Constructive Mathematics as a Programming Logic I: Some Principles of Theory.
A Discrete Approximation and Communication Complexity Approach to the Superposition Problem.
Translations Between Flowchart Schemes and Process Graphs.
Processes with Multiple Entries and Exits.
Implicit definability of algebraic structures by means of program properties.
Two NP-Complete Problems Related to Information Retrieval.
Stable Finite Automata Mappings and Church-Rosser Systems.
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes.
On Development of Dialogue Concurrent Systems.
A Complete Set of Axioms for a Theory of Communicating Sequential Processes.
Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control.
Forets de Greibach et homomorphismes inverses.
Non Deterministic Recursive Program Schemes.
Functorial Semantics of the Type Free lambda-beta eta Calculus.
A Delegation-based Object Calculus with Subtying.
Chain-like Model of Programs Communication.
On the Number of Keys in Relational Databases.
The Equivalence of Schemata with some Feedback.
Linear comparison complexity of the n-cube membership problem.
The Degrees of Nondeterminism in Pushdown Automata.
Built-in Self-testing of Logic Circuits Using Imperfect Duplication.
Monte-Carlo Inference and Its Relations to Reliable Frequency Identification.
Some Formal Systems of the Logic Programming.
Codes, Connected With a Fraction Linear Functions Group and Their Decoding.
Efficient Implementation of Structural Recursion.
On Complexity of Computations with Limited Memory.
Tiling with Bars and Satisfaction of Boolean Formulas.
Some Properties of Language Families Generated by Commutative Languages.
On some topological properties of logic programs.
An Extended Framework for Default Reasoning.
A Kernel Language for Algebraic Specification and Implementation - Extended Abstract.
Algebras with Approximation and Excursive Data Structures.
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).
On Space-bounded Synchronized Alternating Turing Machines.
Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement.
On the Complexity of Realizing Some Systems of the Functions of the Algebra of Logic by Contact and Generalized Contact Circuits.
On Construction of a Complete System of Compression Functions and on Complexity of Monotone Realization of Threshold Boolean Functions.
A Tradeoff Between Pagenumber and Width of Book Embedding of Graphs.
Ambainis-Freivalds' Algorithm for Measure-Once Automata.
Parallel time O(log n) recognition of unambiguous CFLs.
Grammar Systems as Language Analyzers and Recursively Enumerable Languages.
Complexity of Common Subsequence Problems.
The Computational Complexity of Cellular Automata.
On Robust Algorithms for the Maximum Weight Stable Set Problem.
Linearized Disjunctive Normal Forms of Boolean Functions.
Discrete Time Process Algebra with Abstraction.
New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs.
Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete.
Concentration of multidimensional tape-bounded systems of Turing automata and cellular spaces.
Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract).
The Borel Hierarchy is Infinite in the Class of Regular Sets of Trees.
Proof Systems for Struvtured Algebraic Specifications: An Overview.
On Polya series in noncommuting variables.
Automata theory and structural parallel programming.
The Problem of Minimal Implicating Vector.
On the Category of Event Structures with Dense Time.
Statistically Effective Algorithms for Automata Control.
Iterative Arrays with a Wee Bit Alternation.
On Computational Power of Quantum Branching Programs.
Effective Lower Bounds for Complexity of Some Classes of Schemes.
Some Remarks on the Algebra of Automation Mapping.
Equality Languages and Language Families.
One Pebble Does Not Suffice to Search Plane Labyrinths.
Recognizing of Chomsky classes of formal languages by two-dimensional iterative arrays.
On One Approximate Algorithm for Solving Systems of Linear Inequalities with Boolean Variables.
Adaptive Linear List Reorganization for a System Processing Set Queries.
On the length of single dynamic tests for monotone Boolean functions.
Iterated Deterministic Top-Down Look-Ahead.
Complexity of Formula Classes in First Order Logic with Functions.
On the Average Complexity of the Membership Problem for a Generalized Dyck Language.
A Partial Order Method for the Verification of Time Petri Nets.
Behavioural Characterizations of Partial Order Logics.
Generalized PCP Is Decidable for Marked Morphisms.
A Duration Calculus with Infinite Intervals.
An Axiomatization of the Rational Data Objects.
Distributed Acyclic Orientation of Asynchronous Networks.
Some Algebraic Aspects of Recognizability and Rationality.
Tree Language Problems in Pattern Recognition Theory (Extended Abstract).
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).
Space and Reversal Complexity of Probabilistic One-Way Turing Machines.
On the Hierarchy of Nondeterministic Branching k-Programs.
Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents.
On some "non-uniform" complexity measures.
Designing PTASs for MIN-SUM Scheduling Problems.
A Logic for Nondeterministic Functional Programs (Extended Abstract).
Nets over Many Sorted Operator Domains and Their Semantics.
Metrical an Ordered Properties of Powerdomains.
Simulations Between Different Models of Parallel Computers.
A fast heuristic for covering polygons by rectangles.
Generalized Rational Relations and their Logical Definability.
Information-Based Complexity: Recent Results and Open Problems.
Quasi-Equational Logic for Partial Algebras.
Two-States Bilinear Intrinsically Universal Cellular Automata.
About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Büchi Conditions.
On Properties of Certain Synchronizing Tool for Parallel Computations.
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case.
Reliable Networks from Unreliable Gates With Almost Minimal Complexity.
Boolean Functions with a Large Number of Subfunctions and Small Complexity and Depth.
On the Complexity of Analyzing Experiments for Checking local Faults of an Automaton.
Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata.
Unifying Binary-Search Trees and Permutations.
The Parallel Complexity of Arithmetic Computation.
On the Complexity of Decidable Cases of Commutation Problem for Languages.
Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata.
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs.
Dense Families and Key Functions of Database Relation Instances.
Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report).
Differential Resultants and Subresultants.
Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version).
Exponential Lower Bounds for Real-Time Branching Programs.
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure.
Lower Bounds for Deterministic and Nondeterministic Branching Programs.
On Cellular Graph-Automata and Second-Order Definable Graph-Properties.
A Survey of Some Aspects of Computational Learning Theory (Extended Abstract).
The Complexity of the Sequential Choice Mechanism.
The Complexity of Error-Correcting Codes.
A Gemometrical Bound for Integer Programming with Polynomial Constraints.
On an Optimal Quantified Propositional Proof System and a Complete Language for NP cap co-NP.
Communication as Unification in the Petri Box Calculus.
Approximation Algorithms for Time-Dependent Orienteering.
Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract).
A More Categorical Model of Universal Algebra.
The Complexity of Computing Maximal Word Functions.
Modelling Change with the Aid of Knowledge and Time.
Enumerative combinatorics and algebraic languages.
The Equivalence Problem for LL- and LR-Regular Grammars.
Context-Free Languages of Infinite Words As Least Fixpoints.
A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems.
Computing Petri Net Languages by Reductions.
Some Universal Algebraic and Model Theoretic Results in Computer Science.
Computational Calculus and Hardest Languages of Automata with Abstract Storages.
Methodology of Proving a Finite-State Stochastic Representability and Nonrepresentability.
Deductive Program Synthesis and Markov's Principle.
Input-Driven Languages are Recognized in log n Space.
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies.
Index-Sets of Factor-Objects of the Post Numbering.
Adaptive Strategies for Partially Observable Controlled Ranom Series.
Homomorphisms and Concurrent Term Rewriting.
On the Number of DNF Minimal Relatively Arbitrary Measures of Complexity.
Automatic Proof Methods for Algebraic Specifications.
Modular Decompostion of Automata (Survey).
Axiomatising Asynchronous Process Calculi (abstract).
Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings
Logics Which Capture Complexity Classes over the Reals.
Dynamic Data Structures with Finite Population: A Combinatorial Analysis.
The New Way of Probabilistic Compact Testing.
A Generalization of Dijkstra's Calculus to Typed Program Specifications.
Functional Sorts in Data Type Specifications: A Geometric Approach to Semantics.
Classical Simulation Complexity of Quantum Machines.
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates.
Weak Cardinality Theorems for First-Order Logic.
Complexity of Approximating Closest Substring Problems.
Competitive Exploration of Rectilinear Polygons.
Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem.
On Exact and Approximation Algorithms for Distinguishing Substring Selection.
Fast Perfect Phylogeny Haplotype Inference.
Proving Integrality Gaps without Knowing the Linear Program.
Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers.
Constructing Sparse t-Spanners with Small Separators.
Compositionality of Hennessy-Milner Logic through Structural Operational Semantics.
Dimension- and Time-Hierarchies for Small Time Bounds.
Non-uniform Depth of Polynomial Time and Space Simulations.
An Improved Approximation Algorithm for Computing Geometric Shortest Paths.
Operations Preserving Recognizable Languages.
Using Depth to Capture Average-Case Complexity.
Scheduling to Minimize Max Flow Time: Offline and Online Algorithms.
Baire's Categories on Small Complexity Classes.
An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT.
On Boundaries of Highly Visible Spaces and Applications.
Languages Defined by Generalized Equality Sets.
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems.
k-SAT Formulas Using Approximation Techniques.
Context-Sensitive Equivalences for Non-interference Based Protocol Analysis.
Inapproximability Results for Bounded Variants of Optimization Problems.
Periodic Multisorting Comparator Networks.
One-Way Communication Complexity of Symmetric Boolean Functions.
Kleene's Theorem for Weighted Tree-Automata.
Adaptive and Compact Discretization for Weighted Region Optimal Path Finding.
On Lawson's Oriented Walk in Random Delaunay Triangulations.
Graph Searching, Elimination Trees, and a Generalization of Bandwidth.
Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings
Clique-Width for Four-Vertex Forbidden Subgraphs.
Average-Case Non-approximability of Optimisation Problems.
On Approximating Real-World Halting Problems.
On the Black-Box Complexity of Sperner's Lemma.
Algorithms for Graphs Embeddable with Few Crossings Per Edge.
A Self-dependency Constraint in the Simply Typed Lambda Calculus.
Tree Automata and Discrete Distributed Games.
Collapsing Recursive Oracles for Relativized Polynomial Hierarchies.
On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems.
Deterministic Automata on Unranked Trees.
Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems.
A Type System for Computationally Secure Information Flow.
Perfect Reconstruction of Black Pixels Revisited.
The Complexity of Semilinear Problems in Succinct Representation.
A Faster and Simpler 2-Approximation Algorithm for Block Sorting.
The Complexity of Querying External Memory and Streaming Data.
An Explicit Solution to Post's Problem over the Reals.
Leftist Grammars and the Chomsky Hierarchy.
Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals.
Improved Algorithms and Complexity Results for Power Domination in Graphs.
An Improved Approximation Algorithm for TSP with Distances One and Two.
Logspace Optimization Problems and Their Approximability Properties.
Relations Between Average-Case and Worst-Case Complexity.
Completeness and Compactness of Quantitative Domains.
Bounds on the Power of Constant-Depth Quantum Circuits.
Constant Time Generation of Linear Extensions.
Property Testing and the Branching Program Size of Boolean Functions.
On the Power of Unambiguity in Alternating Machines.
Translational Lemmas for Alternating TMs and PRAMs.
The Maximum Resource Bin Packing Problem.
Reconstructing Many Partitions Using Spectral Techniques.
New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem.
On the Incompressibility of Monotone DNFs.
Exact Algorithms for Graph Homomorphisms.
On the Expressiveness of Asynchronous Cellular Automata.
A New Linearizing Restriction in the Pattern Matching Problem.
Using Cultural Algorithms for Constraint Handling in GENOCOP.
Evolutionary Programming VI, 6th International Conference, EP97, Indianapolis, Indiana, USA, April 13-16, 1997, Proceedings
Evolutionary Programming VII, 7th International Conference, EP98, San Diego, CA, USA, March 25-27, 1998, Proceedings
Musica ex Machina: Composing 16th-Century Counterpoint with Genetic Programming and Symbiosis.
An Empirical Investigation of an Evolutionary Algorithm's Ability to Maintain a Known Good Solution.
Learning Geometric Concepts with an Evolutionary Algorithm.
A Note on Usefulness of Geometrical Crossover for Numerical Optimization Problems.
Design of a High-Gain Operational Amplifier and Other Circuits by Means of Genetic Programming.
Resource Allocation for a Hybrid Evolutionary Learning System Used for Pattern Recognition.
Evolutionary Computing in Multi-agent Environments: Operators.
Evolution Strategies for Mixed-Integer Optimization of Optical Multilayer Systems.
Genetic Programming in the Coordination Game with a Chaotic Best-Response Function.
Applying Family Competition to Evolution Strategies for Constrained Optimization.
Applications of Evolutionary Programming for the Prediction of Protein-Protein Interactions.
Fully Automated and Rapic Flexible Docking of Inhibitors Covalently Bound to Serine Proteases.
Evolving Nonlinear Controllers for Backing up a Truck-and-Trailer Using Evolutionary Programming.
Ethnography of Artificial Culture: Specifications, Prospects, and Constraints.
Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma.
A Hybrid Evolutionary Learining System for Synthesizing Neural Network Pattern Recognition Systems.
Evolutionary Algorithms and Economic Models: A View.
A Combined Stochastic and Deterministic Approach for Classification Using Generalized Mixture Densities.
Sphere Operators and Their Applicability for Constrained Parameter Optimization Problems.
A Survey of Constraint Handling Techniques in Evolutionary Computation Methods.
A Theoretical Comparison of Evolutionary Algorithms and Simulated Annealing.
On the Application of Evolutionary Pattern Search Algorithms.
A Programming Language for Artificial Development.
Using Programmatic Motifs and Genetic Programming to Classify Protein Sequences as to Cellular Location.
Evolution of Intelligently Interactive Behaviors for Simulated Forces.
On the "Explorative Power" of ES/EP-like Algorithms.
Local Hillclimbing on an Economic Landscape.
The Dynamics of Evolution Strategies in the Optimization of Traveling Salesman Problems.
Multi-rule-set Decision-making Schemes for a Genetic Algorithm Learning Environment for Classification Tasks.
Evolutionary Programming-Based High-Precision Controller Design.
A Two-Phase Evolutionary Programming for General Constrained Optimization Problem.
Evolutionary Programming-Based Optimal Robust Locomotion Control of Autonomous Mobile Robots.
Evolving the Architecture of a Multi-part Program in Genetic Programming Using Architecture-Altering Operations.
The Loghyperbolic Distribution Fitting by Genetic Algorithm.
Fuzzy Partition and Input Selection by Genetic Algorithms for Designing Fuzzy Rule-Based Classification Systems.
Testing Three Paradigms for Evolving Groups of Cooperative, Simple Agents.
Application of Evolutionary Programming to Earthquake Hypocenter Determination.
A Genetic Programming Methodology for Missile Countermeasures Optimization Under Uncertainty.
On the Application of Cohort-Driven Operators to Continuous Optimization Problems Using Evolutionary Computation.
Symbionticism and Complex Adaptive Systems I: Implications of Having Symbiosis Occur in Nature.
Evolve IV: A Metabolically-Based Artificial Ecosystem Model.
Shape Representations and Evolution Schemes.
An Evolutionary Trade Network Game with Preferential Partner Selection.
Preferential Partner Selection in Evolutionary Labor Markets: A Study in Agent-Based Computational Economics.
Recorded Step Directional Mutation for Faster Convergence.
Application of Parallel Mixed-Integer Evolution Strategies with Mutation Rate Pooling.
Parameter Selection in Particle Swarm Optimization.
Genetic Algorithms for Belief Network Inference: The Role of Scaling and Niching.
Racial harmony and Function Optimization in Genetic Algorithms - The Races Genetic Algorithm.
An Object-Oriented Environment for Artifical Evolution of Protein Sequences: The Example of Rational Design of Transmembrane Sequences.
Controlling Evolution by Means of Machine Learning.
Inductive Learning of Mutation Step-Size in Evolutionary Parameter Optimization.
Airspace Congestion Smoothing by Stochastic Optimization.
A Testbed for Solving Optimization Problems Using Cultural Algorithms.
Culturing Evolution Strategies to Support the Exploration of Novel Environments by an Intelligent Robotic Agent.
The Levels of Learning in Kydon's Hierarchy.
Genetic Mechanisms Underlying the Baldwin Effect Are Evident in Natural Antibodies.
On Making Problems Evolutionarily Friendly - Part 1: Evolving the Most Convenient Representations.
A Note on the Escape Probabilities for Two Alternative Methods of Selection Under Gaussian Mutation.
Variable-Dimensional Optimization with Evolutionary Algorithms Using Fixed-Length Representations.
A Comparison of Evolutionary Programming and Genetic Algorithms for Electronic Part Placement.
Solution Methods for Ordinary Differential Equations Using Evolutionary Algorithms.
Using Evolutionary Programming for Finite Element Problems.
Evolving IIR Filters in Multipath Environments.
Random Search versus Genetic Programming as Engines for Collective Adaptation.
Multilevel Evolutionary Learning in an Artificial Neuromolecular Brain and Its Application to the Recognition of Chinese Characters.
Modeling Speculators with Genetic Programming.
Genetic Programming in the Overlapping Generations Model: An Illustration with the Dynamics of the Inflation Rate.
Non-Acoustic Sensor Array Localization Using Evolutionary Programming.
Evolving Integrated Low-Level Behaviors into Intelligently Interactive Simulated Forces.
Searching Real-Valued Synaptic Weights of Hopfield's Associative Memory Using Evolutionary Programming.
What does the Landscape of a Hopfield Associative Memory Look Like?
Solving Static and Dynamic Fuzzy Constraint Networks Using Evolutionary Hill-Climbing.
An Adaptive Inductive Logic Programming System Using Genetic Programming.
Evolving Artificial Neural Networks through Evolutionary Programming.
Scaling Up Evolutionary Programming Algorithms.
Genetic Algorithms for Automatic Regrouping of Air Traffic Control Sectors.
Evolutionary Domain Covering of an Inference System for Function Approximation.
Visualization of Binary String Convergence by Sammon Mapping.
Integration of Slicing Methods into a Cultural Algorithm in Order to Assist in Large-Scale Engineering Systems Design.
Fuzzy Cultural Algorithms with Evolutionary Programming.
Genetic Search for Object Identification.
Complexity Formalisms, Order and Disorder in the Structure of Art.
Evolutionary Programming Strategies with Self-Adaptation Applied to the Design of Rotorcraft Using Parallel Processing.
An Experimental Investigation of Self-Adaptation in Evolutionary Programming.
An Empirical Study of Recombination in Evolutionary Search.
Evolutionary Metaphors for the Bin Packing Problem.
High Level Control of Evolutionary Learning in Complex Neural Architectures: The Evolutionary Credit Apportionment Approach.
A Simple Model for the Evolution of Communication.
Skillful Genotype Decoding in EAs for Solving the Cutting Problem.
Numeric Mutation as an Improvement to Symbolic Regression in Genetic Programming.
Evolutionary Algorithms Combined with Deterministic Search.
An Extended Evolutionary Programming Algorithm for VLSI Channel Routing.
Automated Rule Extraction for Engine Health Monitoring.
Dynamic Feature Set Training of Neural Nets for Classification.
Genetic Programming for Automatic Target Classification and Recognition.
A Superior Evolutionary Algorithm for 3-SAT.
Evolving Complex Structures via Cooperative Coevolution.
An Analysis of Evolutionary Algorithms Based on Neighborhood and Step Sizes.
Extracting Design Knowledge from Genetic Programs Using Cultural Algorithms.
Gaining Insight into Evolutionary Programming Through Landscape Visualization: An Investigation into IIR Filtering.
Optimization of Thinned Phased Arrays Using Evolutionary Programming.
Evaluation of Evolutionary and Genetic Optimizers: No Free Lunch.
Some Geometric and Algebraic Results on Crossover.
An Artificial Market Analysis of Exchange Rate Dynamics.
A Comparison of Self-Adaptation Methods for Finite State Machines in Dynamic Environments.
Solving Cutting Stock Problems by Evolutionary Programming.
An Iterated Function systems Approach to Emergence.
Dynamics of Mass Distributions: Neural Networks and Iterated Function Systems.
An Evolutionary Algorithm for Designing Feedforward Neural Networks.
Tracking Extrema in Dynamic Environments.
Towards a Self-Replicating Language for Computation.
An Evolutionary Self-Learning Methodology: Some Preliminary Results from a Case Study.
Performance Degradation of Genetic Algorithms under Coordinate Rotation.
Scaling Behavior of the Evolution Strategy when Evolving Neuronal Control Architectures for Autonomous Agents.
Short Notes on the Schema Theorem and the Building Block Hypothesis in Genetic Algorithms.
Comparison between Genetic Algorithms and Particle Swarm Optimization.
An Evolutionary Programming Approach to Self-Adaptation on Finite State Machines.
Reconstruction of DNA Sequence Information from a Simulated DNA Chip Using Evolutionary Programming.
Problem-Independent Handling of Constraints by Use of Metric Penalty Functions.
2-D Genetic Algorithms for Determining Neural Network Structure and Weights.
A Fully Characterized Test Suite for Genetic Programming.
Acquisition of General Adaptive Features by Evolution.
Some Interesting Test Funcitons for Evaluating Evolutionary Programming Strategies.
Evolving Social Structure in Communities of Agents Through Meme Evolution.
Subspace Pursuit for Expolatory Modeling.
Evolution of Iteration in Genetic Programming.
Performance-Enhanced Genetic Programming.
Genetic Programming Exploratory Power and the Discovery of Functions.
Swarm: An Object Oriented Simulation Platform Applied to Markets and Organizations.
Exploring Self-Adaptive Methods to Improve the Efficiency of Generating Approximate Solutions to Travelling Salesman Problems Using Evolutionary Programming.
Raising Theoretical Questions About the Utility of Genetic Algorithms.
Resampling and its Avoidance in Genetic Algorithms.
Distributed Genetic Algorithms on the Intel Paragon, a Large MIMD Computer.
Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems.
Evolutionary Programming for the Optimization of Trellis-Coded Modulation Schemes.
Evolution of Learning Rules for Hard Learning Problems.
Evolving a Generalized Behaviour: Artificial Ant Problem Revisited.
The Effects of Generating More Offspring from Less-Fit Parents.
Combining Control Strategies Using Genetic Algorithms with Memory.
Microtubule Networks as a Medium for Adaptive Information Processing.
Evolutionary Speciation Using Minimal Representation Size Clustering.
An Individually Variable Mutation-Rate Strategy for Genetic Algorithms.
Optimal Mutation and Crossover Rates for a Genetic Algorithm Operating in a Dynamic Environment.
An Agent-Based Computational Model for the Evolution of Trade Networks.
Building Software Frameworks for Evolutionary Computation.
Evolution of Morphological Recognition Systems.
Evolian: Evolutionary Optimization Based on Lagrangian with Constraint Scaling.
Hybrid Interior-Langrangian Penalty Based Evolutionary Optimization.
Evolutionary Programming for Synthesis of Optimal Controllers.
Preliminary Investigations into a Two-State Method of Evolutionary Optimization on Constrained Problems.
Tuning Evolutionary Programming for Conformationally Flexible Molecular Docking.
Evolving Spatially-Localized Projection Filters for SAR Automatic Target Recognition.
Finding Low Energy Conformations of Atomic Clusters Using Evolution Strategies.
Evolutionary Algorithms for Vertex Cover.
PANIC: A Parallel Evolutionary Rule Based System.
Genetic Algorithm Processor on Reprogrammable Architectures.
Evolutionary Optimization of a Neural Network- based Signal Processor for Photometric Data from an Automated DNA Sequencer.