2612 search results - page 150 / 523 » Switching Graphs and Their Complexity |
135
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
This study describes how complex goal-directed behavior can evolve in a hierarchically organized recurrent neural network controlling a simulated Khepera robot. Different types of ...
171
click to vote
PPDP
2010
Springer
15 years 2 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
136
click to vote
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
133
click to vote
SIROCCO
2010
15 years 5 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
101
click to vote
DAM
2006
15 years 4 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...