1414 search results - page 186 / 283 » Randomness and Universal Machines |
129
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
136
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
124
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver n packets from s...
126
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract-- In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit individuals. Th...
CORR
2006
Springer
15 years 3 months ago
2006
Springer
What happens to a dictator once he is out of power is not just a matter of justice or a random result. Using game theory we show that post-power scenarios depend largely on two fac...