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

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

Journal: :Random Struct. Algorithms 2014
Andrew Beveridge Andrzej Dudek Alan M. Frieze Tobias Müller Milos Stojakovic

In a Maker-Breaker game on a graph G, Breaker and Maker alternately claim edges of G. Maker wins if, after all edges have been claimed, the graph induced by his edges has some desired property. We consider four Maker-Breaker games played on random geometric graphs. For each of our four games we show that if we add edges between n points chosen uniformly at random in the unit square by order of ...

2011
José M. Merigó Anna M. Gil-Lafuente Jaime Gil-Aluja

A new aggregation method for decision making is presented by using induced aggregation operators and the index of maximum and minimum level. Its main advantage is that it can assess complex reordering processes in the aggregation that represent complex attitudinal characters of the decision maker such as psychological or personal factors. A wide range of properties and particular cases of this ...

2010
Golam Kabir Razia Sultana Sumi

Due to the popularity of Internet and growing business-to-consumer electronic commerce, the alternative products or services whose information can be acquired through the webs also significantly increased. In this paper, an intelligent agent system, which was initially designed and implemented for the specific application of supplier selection, is proposed to act for consumers in the matters of...

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: :Decision Sciences 2003
W. Matthew Carlyle John W. Fowler Esma Senturk Gel Bosun Kim

We present the Integrated Preference Functional (IPF) for comparing the quality of proposed sets of near-pareto-optimal solutions to bi-criteria optimization problems. Evaluating the quality of such solution sets is one of the key issues in developing and comparing heuristics for multiple objective combinatorial optimization problems. The IPF is a set functional that, given a weight density fun...

Journal: :Healthcare policy = Politiques de sante 2008
Thomas Rathwell Pat Lee Darryl Sturtevant

A key feature of the Regional Training Centres (RTCs) is the scope and nature of their engagement with decision-makers. While the RTCs may believe that they have an excellent association with decision-makers, is that belief shared? The authors of this paper draw on the results of a survey of decision-makers undertaken by the Canadian Health Services Research Foundation (CHSRF) as part of the pr...

2002
Jishnu Hazra Sudhi Seshadri

We analyze a problem where a market maker on behalf of buyers allocates a given amount of order among N suppliers each with finite capacity. Specifically, we analyze a situation in which suppliers have the option of going to open market and selling their capacity at a market price. However, the supplier will incur search costs. Moreover, the demand for the supplier capacity in the open market i...

2006
S. IMPEDOVO

The use of Information and Communication Technologies in the education domain has been characterized by the need of providing customizable new learning solutions and evaluation procedures, which would offer great benefits to the Academic Institutions. This paper deals with the realization of e-learning courses and several related tests, efficient for the education of University students. It det...

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 ...

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

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