Sciweavers

922 search results - page 23 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
15 years 1 months ago
Variable length path coupling
We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path couplin...
Thomas P. Hayes, Eric Vigoda
ICFP
2012
ACM
13 years 2 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
ENTCS
2002
136views more  ENTCS 2002»
14 years 11 months ago
Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors
Every endofunctor F of Set has an initial algebra and a final coalgebra, but they are classes in general. Consequently, the endofunctor F of the category of classes that F induces...
Jirí Adámek, Stefan Milius, Jiri Vel...
GECCO
2000
Springer
113views Optimization» more  GECCO 2000»
15 years 3 months ago
A Non-Linear Schema Theorem for Genetic Algorithms
We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experiment...
William A. Greene
CORR
2008
Springer
58views Education» more  CORR 2008»
14 years 12 months ago
On Ritt's decomposition Theorem in the case of finite fields
11 A classical theorem by Ritt states that all the complete decomposition chains of a univariate polynomial satisfying a certain tameness condition have the same length. In this p...
Jaime Gutierrez, David Sevilla