Name
Title | ||
|---|---|---|
A variable size mechanism of distributed graph programs for creating agent behaviors. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/CEC.2013.6557773 | IEEE Congress on Evolutionary Computation |
Keywords | Field | DocType |
directed graphs,divide and conquer methods,genetic algorithms,multi-agent systems,trees (mathematics),agent behavior creation,benchmark problems,directed graph structures,distributed graph programs,divide and conquer method,dynamic environments,genetic network programming,graph-based evolutionary algorithms,muItiagent systems,string structures,tileworld problem,tree structures,variable size distributed GNP,variable size mechanism,decision making,directed graph,distributed structure,evolutionary computation,reinforcement learning,variable size | Evolutionary algorithm,Computer science,Genetic programming,Theoretical computer science,Artificial intelligence,Divide and conquer algorithms,Genetic algorithm,Benchmark (computing),Reinforcement learning,Mathematical optimization,Directed graph,Evolutionary computation,Machine learning | Conference |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shingo Mabu | 1 | 493 | 77.00 |
| Kotaro Hirasawa | 2 | 704 | 113.11 |
| Masanao Obayashi | 3 | 198 | 26.10 |
| Takashi Kuremoto | 4 | 196 | 27.73 |