Results 51 to 60 of about 39,168 (169)
Em Teia, 2016 O texto apresenta experiências de professoras com práticas de letramento matemático escolar envolvendo acaso, chance, possibilidades, combinatória e análise de dados.
Regina Célia Grando
doaj +1 more source
Indecomposable combinatorial games
Journal of Combinatorial Theory, Series AIn Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed as a disjunctive sum of two forms with smaller birthday. If there are no such summands, then the form is indecomposable.
Michael Fisher +4 more
openaire +3 more sources
Journal of Combinatorial Theory, Series A, 1973 Es wird das folgende verallgemeinerte Mühlespiel betrachtet: Gegeben seien die Mengen \(A_k\) und es sei \(S= \bigcup ^m_{k=1}A_k\). Die beiden Spieler wählen abwechselnd je ein Element aus \(S\). Wer als erster alle Elemente einer der Mengen \(A_k\) zusammen hat, hat gewonnen. Sei \(|A_k| =n\) und sei \(m^*(n)\) die kleinste Zahl \(m\) (= Anzahl der \(
Erdös, P, Selfridge, J.L
openaire +2 more sources
Mathematics of a Process Algebra Inspired by Whitehead’s Process and Reality: A Review
MathematicsProcess algebras have been developed within computer science and engineering to address complicated computational and manufacturing problems. The process algebra described herein was inspired by the Process Theory of Whitehead and the theory of ...
William Sulis
doaj +1 more source
Simple Combinatorial Optimisation Cost Games [PDF]
In this paper we introduce the class of simple combinatorial optimisation cost games, which are games associated to {0, 1}-matrices.A coalitional value of a combinatorial optimisation game is determined by solving an integer program associated with this ...
Velzen, S. van
core +1 more source
LP-games and combinatorial optimization games [PDF]
Cahiers du Centre d'Études de Recherche Opérationnelle, 1992 Summary: A survey is given of combinatorial optimization game theory. In more detail flow games and linear production games are treated.
openaire +5 more sources
Solving Probabilistic Combinatorial Games [PDF]
, 2006 Probabilistic combinatorial games (PCGs) are a model for Go-like games recently introduced by Ken Chen. They differ from normal combinatorial games since terminal positions in each subgame are evaluated by a probability distribution. The distribution expresses the uncertainty in the local evaluation.
Ling Zhao, Martin Müller
openaire +1 more source
Combinatorial optimization in nash games
Computers & Mathematics with Applications, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Minimax Policies for Combinatorial Prediction Games
, 2011 We address the online linear optimization problem when the actions of the forecaster are represented by binary vectors. Our goal is to understand the magnitude of the minimax regret for the worst possible set of actions.
Audibert, Jean-Yves +2 more
core +4 more sources