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

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

2012
Travis R. Grusecki Frans Kaashoek Paul Miller Sean Smith

It is often useful in modern file systems for several files to share one or more data blocks. Block sharing is used to improve storage utilization by storing only one copy of a block shared by multiple files or volumes. This thesis proposes an approach, called Space Maker, which uses garbage collection techniques to simplify the up-front cost of file system operations, moving some of the more d...

Journal: :CoRR 2016
Marian Dragoi Ciprian Palaghianu

The paper deals with a step-wise analytic hierarchy process (AHP) applied by a group of decision makers wherein nobody has a dominant position and it is unlikely to come to terms with respect to either the weights of different objectives or expected utilities of different alternatives. One of the AHP outcomes, that is the consistency index is computed for each decision maker, for all other deci...

Journal: :CoRR 2017
Milos Stojakovic Nikola Trkulja

We look at the unbiased Maker-Breaker Hamiltonicity game played on the edge set of a complete graph Kn, where Maker’s goal is to claim a Hamiltonian cycle. First, we prove that, independent of who starts, Maker can win the game for n = 8 and n = 9. Then we use an inductive argument to show that, independent of who starts, Maker can win the game if and only if n ≥ 8. This, in particular, resolve...

Journal: :Journal of Symbolic Logic 2022

Abstract We investigate Maker–Breaker games on graphs of size $\aleph _1$ in which Maker’s goal is to build a copy the host graph. establish firm dependence outcome game axiomatic framework. Relating this, we prove that there winning strategy for Maker $K_{\omega ,\omega _1}$ -game under ZFC+MA+ $\neg $ CH and Breaker ZFC+CH. similar result -game. Here, has ZF+DC+AD, while one ZFC+CH again.

The theory of constraints is an approach to production planning and control that emphasizes on the constraints to increase throughput by effectively managing constraint resources. One application in theory of constraints is product mix decision. Product mix influences the performance measures in multi-product manufacturing system. This paper presents an alternative approach by using of goal pro...

2002
Jean-Marc Tallon Jean-Christophe Vergnaud

Debates around the assumption of rationality in economic theory abound and are too numerous to be listed here. Traditionally, rationality of a decision maker is captured by a set of (testable) axioms, whose meaning and strength can be discussed. These rationality axioms however do not all have the same status in the sense that they bear on different things. One could actually distinguish three ...

Journal: :سیاست 0
غلامعلی سلیمانی استادیار گروه تاریخ و تمدن و انقلاب اسلامی دانشکده معارف و اندیشۀ اسلامی دانشگاه تهران

the aim of this research is consider the importance of decision maker level of analysis in the study of foreign policy. this capability created by the regard to the role of man in foreign policy and international relations theories. however, the main research question is whether the decision maker level of analysis will be the theoretical support for the analysis of foreign policy and what are ...

Journal: :SIAM J. Discrete Math. 2015
Dennis Clemens Asaf Ferber Roman Glebov Dan Hefetz Anita Liebenau

For a tree T on n vertices, we study the Maker-Breaker game, played on the edge set of the complete graph on n vertices, which Maker wins as soon as the graph she builds contains a copy of T . We prove that if T has bounded maximum degree, then Maker can win this game within n+ 1 moves. Moreover, we prove that Maker can build almost every tree on n vertices in n−1 moves and provide non-trivial ...

Journal: :Combinatorics, Probability & Computing 2008
Ohad N. Feldheim Michael Krivelevich

A Graph Construction Game is a Maker-Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graph KN . Maker’s aim is to claim a copy of a given target graph G while Breaker’s aim is to prevent Maker from doing so. In this paper we show that if G is a d-degenerate graph on n vertices and N > d2n, then Maker can claim a copy of G in at most d2n rounds....

2008
Maciej Nowak

The paper considers a discrete stochastic multicriteria problem. This problem can be defined by a finite set of actions A, a set of attributes X and a set of evaluations E. It is assumed that the performance probability distributions for each action on each attribute are known. A new procedure for such a problem is proposed. It is based on two concepts: stochastic dominance and interactive appr...

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

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