We stand with Ukraine

We stand with Ukraine

Patrick Ediger

According to our database¹, Patrick Ediger authored at least 19 papers between 2008 and 2013.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2013

Rectangular vs Triangular Routing with Evolved Agents.

[BibT_eX]

[DOI]

,

,

Dominique Désérable

J. Cell. Autom., 2013

2012

Routing in the Triangular Grid with Evolved Agents.

[BibT_eX]

[DOI]

,

,

Dominique Désérable

J. Cell. Autom., 2012

Efficiency Analysis of the Time-Shuffling Method for the Evolution of Agent Behavior.

[BibT_eX]

[DOI]

,

Int. J. Found. Comput. Sci., 2012

2011

Modellierung und Techniken zur Optimierung von Multiagentensystemen in zellularen Automaten.

[BibT_eX]

[DOI]

PhD thesis, 2011

Effectively Evolving Finite State Machines Compared to Enumeration.

[BibT_eX]

[DOI]

,

,

Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011

2010

Evolving hybrid time-shuffled behavior of agents.

[BibT_eX]

[DOI]

,

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Routing Based on Evolved Agents.

[BibT_eX]

[DOI]

,

Proceedings of the ARCS '10, 2010

All-to-All Communication with CA Agents by Active Coloring and Acknowledging.

[BibT_eX]

[DOI]

,

Proceedings of the Cellular Automata, 2010

2009

A scalable configurable architecture for the massively parallel GCA model.

[BibT_eX]

[DOI]

Johannes Jendrsczok

,

,

Int. J. Parallel Emergent Distributed Syst., 2009

CA Models for Target Searching Agents.

[BibT_eX]

[DOI]

,

Proceedings of the 15th International Workshop on Cellular Automata and Discrete Complex Systems, 2009

Solving All-to-All Communication with CA Agents More Effectively with Flags.

[BibT_eX]

[DOI]

,

Proceedings of the Parallel Computing Technologies, 10th International Conference, 2009

Combining genetic algorithm with time-shuffling in order to evolve agent systems more efficiently.

[BibT_eX]

[DOI]

,

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

On the Effectiveness of Evolution Compared to Time-Consuming Full Search of Optimal 6-State Automata.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Genetic Programming, 12th European Conference, 2009

Evolving 6-State Automata for Optimal Behaviors of Creatures Compared to Exhaustive Search.

[BibT_eX]

[DOI]

,

,

Mathias Halbach

Proceedings of the Computer Aided Systems Theory, 2009

2008

Is a non-uniform system of creatures more efficient than a uniform one?

[BibT_eX]

[DOI]

,

,

Mathias Halbach

Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

Optimizing the creature's rule for all-to-all communication.

[BibT_eX]

,

Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

How Efficient are Creatures with Time-shuffled Behaviors?

[BibT_eX]

[DOI]

,

,

Mathias Halbach

Proceedings of the 9th Workshop on Parallel Systems and Algorithms (PASA) held at the 21st Conference on the Architecture of Computing Systems (ARCS), 2008

Evolving Multi-creature Systems for All-to-All Communication.

[BibT_eX]

[DOI]

,

Proceedings of the Cellular Automata, 2008

Improving the Behavior of Creatures by Time-Shuffling.

[BibT_eX]

[DOI]

,

Proceedings of the Cellular Automata, 2008

Loading...