نتایج جستجو برای: paired domination game
تعداد نتایج: 160067 فیلتر نتایج به سال:
In this paper we seek to account for scalar implicatures and Horn’s division of pragmatic labor in game-theoretical terms by making use mainly of refinements of the standard solution concept of signaling games. Scalar implicatures are accounted for in terms of Farrell’s (1993) notion of a ‘Neologism-Proof’ equilibrium together with Grice’s maxim of Quality. Horn’s division of pragmatic labor is...
In this paper we seek to account for scalar implicatures and Horn’s division of pragmatic labor in game-theoretical terms by making use mainly of refinements of the standard solution concept of signaling games. Scalar implicatures are accounted for in terms of Farrell’s (1993) notion of a ‘Neologism-Proof’ equilibrium together with Grice’s maxim of Quality. Horn’s division of pragmatic labor is...
OBJECTIVE To adapt a pre-existing educational game, making it specific to the teaching of blood pressure auscultatory measurement, and to apply this game in a pilot study. METHOD The original game cards were altered by the authors and submitted to content validation by six experts in the field. After redesigns, the game was applied to 30 subjects, who answered a questionnaire (pre-test and po...
Pell graphs are defined on certain ternary strings as special subgraphs of Fibonacci cubes odd index. In this work the domination number, total 2-packing connected paired and signed number studied. Using integer linear programming, exact values some estimates for these numbers small obtained. Furthermore, theoretical bounds obtained graphs.
We consider two infinite games, played on a countable graph G given with an integer vertex labelling. One player seeks to construct a ray (a one-way infinite path) in G, so that the ray’s labels dominate or elude domination by an integer sequence being constructed by another player. For each game, we give a structural characterization of the graphs on which one player or the other can win, prov...
We consider two innnite games, played on a countable graph G given with an integer vertex labelling. One player seeks to construct a ray (a one-way innnite path) in G, so that the ray's labels dominate or elude domination by an integer sequence being constructed by another player. For each game, we give a structural characterization of the graphs on which one player or the other can win, provid...
game-based practicing of materials can be seen as a method of capturing an essence of real- life expe-rience which is commonly missing in the conventional face-to-face classrooms. to serve the l2 learn-ers' immediate communicative needs in wider classroom and societal contexts, this study sought to place l2 english learners within an interactional social framework through reinforcing their...
I develop a new game-theoretic approach based, not on conventional Boolean two-valued logic, but instead on linguistic fuzzy logic which admits linguistic truth values. A linguistic fuzzy game is defined with linguistic fuzzy strategies, linguistic fuzzy preferences, and the rules of reasoning and inferences of the game operate according to linguistic fuzzy logic, not Boolean logic. This leads ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید