نتایج جستجو برای: maker one

تعداد نتایج: 2012207  

Journal: :Tecnologias, Sociedade e Conhecimento 2020

Journal: :Ökologisches Wirtschaften - Fachzeitschrift 2016

Journal: :International Journal of Bio-Inspired Computation 2017

Journal: :The Electronic Journal of Combinatorics 2015

2004
C. Perkgoz K. Kato H. Katagiri

In this paper, we focus on multiobjective integer programming problems with random variable coefficients in objective functions and/or constraints. For such multiobjective problems, after reformulation of them on the basis of an expectation optimization model and a variance minimization model for the chance constrained programming, incorporating fuzzy goals of the decision maker for the objecti...

2007
Marc Henry

We give a representation of analogical reasoning in choice under uncertainty. A decision maker is faced with two decision problems, a familiar and a novel one. It is shown that, under assumptions that capture the salience of alignable differences in choice, the decision maker can be construed as choosing between acts in the novel decision problem as if drawing all likelihood information from a ...

2012
John Buschert

Musician Maker is a system to allow novice players the opportunity to create expressive improvisational music. While the system plays an accompaniment background chord progression, each participant plays some kind of controller to make music through the system. The program takes the signals from the controllers and adjusts the pitches somewhat so that the players are limited to notes which fit ...

Journal: :Electr. J. Comb. 2010
Padmini Mukkamala Dömötör Pálvölgyi

We show that there is an m = 2n + o(n), such that, in the Maker-Breaker game played on Z where Maker needs to put at least m of his marks consecutively in one of n given winning directions, Breaker can force a draw using a pairing strategy. This improves the result of Kruczek and Sundberg [15] who showed that such a pairing strategy exits if m ≥ 3n. A simple argument shows that m has to be at l...

2005
Martin Kutz

In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergraph until either Maker wins by getting a complete edge or all vertices are taken without this happening, a Breaker win. For the class of almost-disjoint hypergraphs of rank three (edges with up to three vertices only and edge-intersections on at most one vertex) we show how to find optimal strategi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید