Sciweavers

349 search results - page 64 / 70
» The Finite and the Infinite
Sort
View
MOR
2006
79views more  MOR 2006»
13 years 10 months ago
The Value of Markov Chain Games with Lack of Information on One Side
We consider a two-player zero-sum game given by a Markov chain over a finite set of states K and a family of zero-sum matrix games (Gk)kK. The sequence of states follows the Marko...
Jérôme Renault
SIAMDM
2008
115views more  SIAMDM 2008»
13 years 10 months ago
Rank-Width and Well-Quasi-Ordering
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
Sang-il Oum
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 7 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
JSYML
2010
120views more  JSYML 2010»
13 years 4 months ago
Universally measurable subgroups of countable index
We prove that any countable index, universally measurable subgroup of a Polish group is open. By consequence, any universally measurable homomorphism from a Polish group into the i...
Christian Rosendal
SIAMADS
2010
122views more  SIAMADS 2010»
13 years 4 months ago
Local/Global Analysis of the Stationary Solutions of Some Neural Field Equations
Neural or cortical fields are continuous assemblies of mesoscopic models, also called neural masses, of neural populations that are fundamental in the modeling of macroscopic parts...
Romain Veltz, Olivier D. Faugeras