Sciweavers

349 search results - page 38 / 70
» The Finite and the Infinite
Sort
View
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
14 years 10 months ago
Clairvoyant scheduling of random walks
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
Péter Gács
AML
2010
130views more  AML 2010»
13 years 10 months ago
Additivity of the two-dimensional Miller ideal
Let J (M2 ) denote the -ideal associated with two-dimensional Miller forcing. We show that it is relatively consistent with ZFC that the additivity of J (M2 ) is bigger than the c...
Otmar Spinas, Sonja Thiele
LFCS
1992
Springer
14 years 1 months ago
Machine Learning of Higher Order Programs
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
Ganesh Baliga, John Case, Sanjay Jain, Mandayam Su...
AIML
2008
13 years 11 months ago
A modal perspective on monadic second-order alternation hierarchies
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
Antti Kuusisto
DM
2008
49views more  DM 2008»
13 years 10 months ago
Periodical states and marching groups in a closed owari
Owari is an old African game that consists of cyclically ordered pits that are filled with pebbles. In a sowing move all the pebbles are taken out of one pit and distributed one b...
Henning Bruhn