Wyniki wyszukiwania dla: GRAPH CHROMATIC GAME

• Preface

  Publikacja

  • P. Borowiecki
  • E. Burchardt-Drgas
  • E. Sidorowicz

  - Discussiones Mathematicae Graph Theory - Rok 2011

  This special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 13th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 18-23 September 2009 in Szklarska Poręba, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, and 2003-2007 in Karpacz. The meeting was organized by the Faculty of Mathematics, Computer...

  Pełny tekst do pobrania w portalu

• Game Developers Conference

  Konferencje

• Block graphs with large paired domination multisubdivision number

  Publikacja

  • C. M. Mynhardt
  • J. Raczek

  - Discussiones Mathematicae Graph Theory - Rok 2021

  The paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.

  Pełny tekst do pobrania w portalu

• EEG data recorded in three mental states

  Dane Badawcze

  open access

  • A. Kurowski
  • K. Mrozik
  • B. Kostek

  Electroencephalographic (EEG) signals were acquired from 17 (14 males, 3 females) participants aged between 20 and 30 years. 

• Graph Drawing

  Konferencje

• Australian Game Developers Conference

  Konferencje

• On-line P-coloring of graphs

  Publikacja

  • P. Borowiecki

  - Discussiones Mathematicae Graph Theory - Rok 2006

  For a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...

  Pełny tekst do pobrania w portalu

• International Symposium on Algorithmic Game Theory

  Konferencje

• Dynamic Graph Workshop

  Konferencje

• ANFIS-Based NPC Population Control in Video Games

  Publikacja

  • T. M. Boiński

  - Rok 2021

  Modern computer games aim at providing rich, vivid worlds. The aim is to encourage the player to explore and interact with the in-game world. To describe the complex relations between in-game NPCs and their surrounding fuzzy logic is used. The paper presents ANFIS based population control in the video game. We present an approach allowing stabilizing the number of NPCs in-game by providing a certain amount of food to the environment....

  Pełny tekst do pobrania w portalu

• New Zealand Game Developers Conference [FUSE]

  Konferencje

• MSRI Combinatorial Game Theory Research Workshop

  Konferencje

• Topological and Geometric Graph Theory

  Konferencje

• Techniques and Problems in Graph Theory

  Konferencje

• International Conference on Graph Transformations

  Konferencje

• Workshop on Probabilistic Graph Theory

  Konferencje

• Individual corporate reputation, perception of collective corporate reputation, stock market investments

  Dane Badawcze

  open access

  • A. Blajer-Gołębiewska

  There are two ways of conceiving of corporate reputation: individual and collective. Although related, they are not driven by the same factors. Thus, each of them may have a distinct impact on investment decisions.  The following dataset includes the data obtained in an incentivized economic experiment based on vignette studies. We induced the perception...

• Krzysztof Goczyła prof. dr hab. inż.

  Osoby

  Katedra Inżynierii Oprogramowania

  Krzysztof Goczyła, profesor zwyczajny Politechniki Gdańskiej, informatyk, specjalista z inżynierii oprogramowania, inżynierii wiedzy i baz danych. Ukończył studia wyższe na  Wydziale Elektroniki Politechniki Gdańskiej w 1976 r. jako magister inżynier elektronik w specjalności automatyka. Na Politechnice Gdańskiej pracuje od 1976. Na Wydziale Elektroniki PG w 1982 r. uzyskał doktorat z informatyki, a w 1999 r. habilitację. W 2012...

• Dataset of non-isomorphic graphs of the coloring types (K4,K4;n), 1<n<R(4,4)

  Dane Badawcze

  open access

  • R. Fidytek
  • G. Graff

  For K4 graph, a coloring type (K4,K4;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the K4 subgraph in the second color (representing by edges in the graph).The Ramsey number R(4,4) is the smallest natural number n such that for any edge coloring of...

• PRZYKŁAD MODELU GRY FABULARNEJ WSPIERAJĄCY PROCES ZAANGAŻOWANIA I MOTYWACJI STUDENTÓW WYŻSZYCH UCZELNI TECHNICZNYCH

  Publikacja

  • T. Niksa-Rynkiewicz

  - Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej - Rok 2018

  Artykuł prezentuje koncepcję budowy uniwersalnego scenariusza gry fabularnej, która pomaga zbudować zaangażowanie wśród studentów uczelni technicznych. Jednym ze sposobów na wzmożenie motywacji w procesie uczenia się jest gamifikacja. Gdy gamifikacja wspiera proces nauczania często tworzone są modele tematycznie związane z problematyką danego przedmiotu. Scenariusz proponowanej gry jest uniwersalny i można go wykorzystać w ramach...

  Pełny tekst do pobrania w portalu

• Framework for gamification of specialized subjects within engineering studies

  Publikacja

  • P. Ziółkowski

  - Rok 2017

  Gamification is a relatively new term forged along with the occurrence of new information technology, especially easy access to internet and smartphones. Gamification is a use of game mechanics, to modify the behavior of people in non-games situations to increase the involvement of individuals. The method is based on the pleasure that comes from overcoming the obstacles to reach next achievable level, which consists of challenges,...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)

  Dane Badawcze

  open access

  • R. Fidytek
  • G. Graff

  For K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...

• Dataset of non-isomorphic graphs being coloring types (K6-e,Km-e;n), 2<m<5, 1<n<R(K6-e,Km-e)

  Dane Badawcze

  open access

  • R. Fidytek
  • G. Graff

  For K6-e and Km-e graphs, the type coloring (K6-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K6-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed. The Ramsey number R(K6-e,Km-e) is the smallest...

• Dataset of non-isomorphic graphs of the coloring types (K4,Km-e;n), 2<m<5, 1<n<R(K4,Km-e)

  Dane Badawcze

  open access

  • R. Fidytek
  • G. Graff

  For K4 and Km-e graphs, a coloring type (K4,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4,Km-e)...

• Equitable colorings of some variation of corona products of cubic graphs

  Publikacja

  • M. Kubale
  • H. Furmańczyk

  - Archives of Control Sciences - Rok 2024

  The problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.

  Pełny tekst do pobrania w portalu

• Conference on Graph Theory and Discrete Geometry

  Konferencje

• EuroConference on Combinatorics, Graph Theory and Applications

  Konferencje

• Workshop on Computational Graph Theory and Combinatorics

  Konferencje

• Workshop on Algorithms And Models For The Web Graph

  Konferencje

• The complexity of zero-visibility cops and robber

  Publikacja

  • D. Dereniowski
  • D. Dyer
  • R. M. Tifenbach
  • B. Yang

  - THEORETICAL COMPUTER SCIENCE - Rok 2015

  We consider the zero-visibility cops &amp; robber game restricted to trees. We produce a characterisation of trees of copnumber k and We consider the computational complexity of the zero-visibility Cops and Robber game. We present a heavily modified version of an already-existing algorithm that computes the zero-visibility copnumber of a tree in linear time and we show that the corresponding decision problem is NP-complete on a nontrivial...

  Pełny tekst do pobrania w portalu

• Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)

  Dane Badawcze

  open access

  • R. Fidytek
  • G. Graff

  For Km and K3-e graphs, a coloring type (Km,K3-e;n) is such an edge coloring of the full Kn graph, which does not have the Km subgraph in the first color (representing by no edges in the graph) or the K3-e subgraph in the second color (representing by edges in the graph). K3-e means the full Km graph with one edge removed.The Ramsey number R(Km,K3-e)...

• Progress on Roman and Weakly Connected Roman Graphs

  Publikacja

  • J. Raczek
  • R. Zuazua

  - Mathematics - Rok 2021

  A graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....

  Pełny tekst do pobrania w portalu

• Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).

  Dane Badawcze

  open access

  • R. Fidytek
  • G. Graff

  For K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...

• INDIRECT CONTROL OVER SUBORDINATE UNITS

  Publikacja

  • B. Jakusz
  • P. Kulesza
  • M. Wójcik

  - Zeszyty Naukowe Wydziału ETI Politechniki Gdańskiej. Technologie Informacyjne - Rok 2014

  Developing a game universe usually involves creation of various units which can be both, encountered by a player or controlled by him. There is a number of works considering autonomous behaviors of units wandering around the game world. When it comes to the units controlled by the player, they are often deprived of autonomy and are strictly controlled by the player. This paper presents a concept of units behavior depending on their...

• Indirect control over subordinate units

  Publikacja

  • B. Jakusz
  • P. Kulesza
  • M. Wójcik

  - Rok 2012

  Developing a game universe usually involves creation of various units which can be both, encountered by a player or controlled by him. There is a number of works considering autonomous behaviours of units wandering around the game world. When it comes to the units controlled by the player, they often are lack of autonomy and are strictly controlled by the player. This paper presents a concept of units behaviour depending on their...

• ArtsIT, Interactivity & Game Creation (International Conference on Arts and Technology)

  Konferencje

• Dynamic F-free Coloring of Graphs

  Publikacja

  • P. Borowiecki
  • E. Sidorowicz

  - GRAPHS AND COMBINATORICS - Rok 2018

  A problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...

  Pełny tekst do pobrania w portalu

• Dataset of non-isomorphic graphs being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)

  Dane Badawcze

  open access

  • R. Fidytek
  • G. Graff

  For K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4-e,Km-e) is the smallest...

• On proper (1,2)‐dominating sets in graphs

  Publikacja

  • A. Michalski
  • I. Włoch
  • M. Dettlaff
  • M. Lemańska

  - MATHEMATICAL METHODS IN THE APPLIED SCIENCES - Rok 2022

  In 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)

  Dane Badawcze

  open access

  • R. Fidytek
  • G. Graff

  For K3 and Km graphs, a coloring type (K3,Km;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km subgraph in the second color (representing by edges in the graph).The Ramsey number R(3,m) is the smallest natural number n such that for any edge coloring...

• Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)

  Dane Badawcze

  open access

  • R. Fidytek
  • G. Graff

  For K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3-e,Km-e) is the smallest...

• On trees with double domination number equal to total domination number plus one

  Publikacja

  • M. Krzywkowski

  - ARS COMBINATORIA - Rok 2011

  A total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Experimental economics in business education: Using simple games to achieve multifaceted effects

  Publikacja

  • K. Zięba

  - Rok 2014

  Economics differs from other sciences not only because of its normative part, but also because of very limited use of experiments. In this way, economics is often perceived as being methodologically more similar to astronomy or meteorology rather than physics or chemistry. Over last decades, however, experimental economics has been significantly developed. This chapter presents some of the possibilities for academic teachers to...

• JamesBot - an intelligent agent playing StarCraft II

  Publikacja

  • Z. Kowalczuk
  • J. Cybulski
  • M. Czubenko

  - Rok 2019

  The most popular method for optimizing a certain strategy based on a reward is Reinforcement Learning (RL). Lately, a big challenge for this technique are computer games such as StarCraft II which is a real-time strategy game, created by Blizzard. The main idea of this game is to fight between agents and control objects on the battlefield in order to defeat the enemy. This work concerns creating an autonomous bot using reinforced...

  Pełny tekst do pobrania w portalu

• South African International Graph Theory Conference

  Konferencje

• Colorings of the Strong Product of Circulant Graphs

  Publikacja

  • M. Jurkiewicz

  - Rok 2012

  Graph coloring is one of the famous problems in graph theory and it has many applications to information theory. In the paper we present colorings of the strong product of several circulant graphs.

• Mitigating Traffic Remapping Attacks in Autonomous Multi-hop Wireless Networks

  Publikacja

  • J. Konorski
  • S. Szott

  - IEEE Internet of Things Journal - Rok 2022

  Multihop wireless networks with autonomous nodes are susceptible to selfish traffic remapping attacks (TRAs). Nodes launching TRAs leverage the underlying channel access function to receive an unduly high Quality of Service (QoS) for packet flows traversing source-to-destination routes. TRAs are easy to execute, impossible to prevent, difficult to detect, and harmful to the QoS of honest nodes. Recognizing the need for providing...

  Pełny tekst do pobrania w portalu

• A collection of directed graphs for the minimum cycle mean weight computation

  Dane Badawcze

  open access

  • P. Pilarczyk
  • G. Graff

  This dataset contains definitions of the 16 directed graphs with weighted edges that were described in the following paper: Paweł Pilarczyk, A space-efficient algorithm for computing the minimum cycle mean in a directed graph, Journal of Mathematics and Computer Science, 20 (2020), no. 4, 349--355, DOI: 10.22436/jmcs.020.04.08, URL: http://dx.doi.org/10.22436/jmcs.020.04.08   These...

• Which digital games are appropriate for our children?

  Publikacja

  • A. Landowska

  - Rok 2018

  Chapter contains advice on which digital games are accessible for children with diverse impairments. It providess a process for choosing the device, the game and adjusting it. It might be of use for therapists, techers and caregivers.

  Pełny tekst do pobrania w serwisie zewnętrznym

• Context Search Algorithm for Lexical Knowledge Acquisition

  Publikacja

  • J. Szymański
  • W. Duch

  - CONTROL AND CYBERNETICS - Rok 2012

  A Context Search algorithm used for lexical knowledge acquisition is presented. Knowledge representation based on psycholinguistic theories of cognitive processes allows for implementation of a computational model of semantic memory in the form of semantic network. A knowledge acquisition using supervised dialog templates have been performed in a word game designed to guess the concept a human user is thinking about. The game,...