3471 search results - page 196 / 695 » Obstacle Numbers of Graphs |
128
click to vote
FLAIRS
2006
15 years 6 months ago
2006
We propose to improve the efficiency of genetic programming, a method to automatically evolve computer programs. We use graph-based data mining to identify common aspects of highl...
143
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
106
click to vote
ENDM
2006
15 years 4 months ago
2006
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
132
Voted
CDC
2010
IEEE
14 years 12 months ago
2010
IEEE
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
118
click to vote
ICDT
2007
ACM
15 years 11 months ago
2007
ACM
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...