19 research outputs found
Pogamut a StarCraft v prostředí Emergent
No full textToolkit Pogamut určený k prototypování agentů počítačových her byl doposud používán k prototypování agentů založených na 3D FPS Unreal Tournament 2004 a jeho pokračo- váních. Po připojení prostředí RTS Defcon vyvstala otázka, jak by bylo obtížné k němu připojit další, typově odlišná prostředí a mechanismy selekce akcí. Abychom tuto flexi- bilitu otestovali, připojili jsme k Pogamutu podstatně komplexnější RTS hru StarCraft:Brood War a simulátor rozsáhlých neuronových sítí Emergent, společně s mechanismy POSH a Jason používanými pro selekci akcí agenta. Práce podrobně rozebírá provedená připojení a na příkladech demonstruje jejich funkčnost. Součástí práce je i web s video tutoriály a návody k použití. V práci se dále věnujeme připravenosti Pogamutu k připojování dalších prostředí a rozebíráme způsob použitý při napojení Emergentu a StarCraftu.The Pogamut toolkit designed for rapid prototyping of computer game agents has been so far used for prototyping the agents based on 3D FPS Unreal Tournament 2004 and its sequels. After the environment of RTS Defcon was connected to Pogamut a question arose how difficult it would be to connect some other significantly different environments and action selection mechanisms. In order to test this flexibility of Pogamut we have interconnected it with more complex RTS video game StarCraft:Brood War and large neural network simulator Emergent, together with Jason and POSH action selection mechanisms. The work analyzes created connections to detail and demonstrates their functionality on examples. An integral part of the work is also web with video tutorials and guides. In this work we also analyze Pogamut's readiness to be connected to other environments.Department of Software and Computer Science EducationKatedra softwaru a výuky informatikyMatematicko-fyzikální fakultaFaculty of Mathematics and Physic
A Self-Stabilizing (delta+1)- Edge-Coloring Algorithm of Arbitrary Graphs.
No full textInternational audienceGiven a graph G = (V,E), an edge-coloring of G is a function from the set of edges E to colors {1, 2, · · ·, k} such that any two adjacent edges are assigned different colors. In this paper, we propose a self-stabilizing edge-coloring algorithm in a polynomial number of moves. The protocol assumes the unfair central dæmon and the coloring is a (delta + 1)-edge-coloring of G, where delta is the maximum degree in G. To our knowledge, we give the first self-stabilizing edge-coloring algorithm using (delta+ 1) colors of arbitrary graphs
[r,s,t]-coloring of trees and bipartite graphs
No full textAbstractLet G=(V,E) be a graph with vertex set V and edge set E. Given non-negative integers r, s and t, an [r,s,t]-coloring of a graph G is a function c from V(G)∪E(G) to the color set {0,1,…,k−1} such that |c(vi)−c(vj)|≥r for every two adjacent vertices vi, vj∈V, |c(ei)−c(ej)|≥s for every two adjacent edges ei, ej∈E, and |c(vi)−c(ej)|≥t for every vertex vi and its incident edge ej. Thus, an [r,s,t]-coloring is a generalization of the total coloring and the classical vertex and edge colorings of graphs. The [r,s,t]-coloring can have many applications in different fields like scheduling [A. Kemnitz, M. Marangio, [r,s,t]-colorings of graphs, Discrete Mathematics 307 (2) (2007) 199–207], channel assignment problem [F. Bazzaro, M. Montassier, A. Raspaud, (d,1)-total labelling of planar graphs with large girth and high maximum degree, Discrete Mathematics 307 (2007) 2141–2151], etc. The [r,s,t]-chromatic number χr,s,t(G) of G is the minimum k such that G admits an [r,s,t]-coloring. In our paper, we give exact values (or bounds in one case) of the [r,s,t]-chromatic number of stars, for every positive r, s and t. We also provide exact values and some tight bounds of this parameter for trees and bipartite graphs
A Self-Stabilizing (delta+1)- Edge-Coloring Algorithm of Arbitrary Graphs.
No full textInternational audienceGiven a graph G = (V,E), an edge-coloring of G is a function from the set of edges E to colors {1, 2, · · ·, k} such that any two adjacent edges are assigned different colors. In this paper, we propose a self-stabilizing edge-coloring algorithm in a polynomial number of moves. The protocol assumes the unfair central dæmon and the coloring is a (delta + 1)-edge-coloring of G, where delta is the maximum degree in G. To our knowledge, we give the first self-stabilizing edge-coloring algorithm using (delta+ 1) colors of arbitrary graphs
A Self-Stabilizing (delta+1)- Edge-Coloring Algorithm of Arbitrary Graphs.
No full textInternational audienceGiven a graph G = (V,E), an edge-coloring of G is a function from the set of edges E to colors {1, 2, · · ·, k} such that any two adjacent edges are assigned different colors. In this paper, we propose a self-stabilizing edge-coloring algorithm in a polynomial number of moves. The protocol assumes the unfair central dæmon and the coloring is a (delta + 1)-edge-coloring of G, where delta is the maximum degree in G. To our knowledge, we give the first self-stabilizing edge-coloring algorithm using (delta+ 1) colors of arbitrary graphs
A Self-Stabilizing (delta+1)- Edge-Coloring Algorithm of Arbitrary Graphs.
No full textInternational audienceGiven a graph G = (V,E), an edge-coloring of G is a function from the set of edges E to colors {1, 2, · · ·, k} such that any two adjacent edges are assigned different colors. In this paper, we propose a self-stabilizing edge-coloring algorithm in a polynomial number of moves. The protocol assumes the unfair central dæmon and the coloring is a (delta + 1)-edge-coloring of G, where delta is the maximum degree in G. To our knowledge, we give the first self-stabilizing edge-coloring algorithm using (delta+ 1) colors of arbitrary graphs
A Self-Stabilizing (delta+1)- Edge-Coloring Algorithm of Arbitrary Graphs.
No full textInternational audienceGiven a graph G = (V,E), an edge-coloring of G is a function from the set of edges E to colors {1, 2, · · ·, k} such that any two adjacent edges are assigned different colors. In this paper, we propose a self-stabilizing edge-coloring algorithm in a polynomial number of moves. The protocol assumes the unfair central dæmon and the coloring is a (delta + 1)-edge-coloring of G, where delta is the maximum degree in G. To our knowledge, we give the first self-stabilizing edge-coloring algorithm using (delta+ 1) colors of arbitrary graphs
[r,s,t]-Coloring of Trees and Bipartite Graphs
No full textInternational audienceLet be a graph with vertex set and edge set . Given non negative integers , and , an []-\emph{coloring} of a graph is a function from to the color set such that for every two adjacent vertices , , for every two adjacent edges , , and for every vertex and its incident edge . Thus, an []-coloring is a generalization of the total coloring and the classical vertex and edge colorings of graphs. The []-coloring can have many applications in different fields like scheduling \cite{Kemnitz1}, channel assignment problem \cite{Bazzaro},.... The []\textit{-chromatic number} of is the minimum such that admits an []-coloring. In our paper, we give exact values (or bounds in one case) of the []-chromatic number of stars, for every positive , and . We also provide exact values and some tight bounds of this parameter for trees and bipartite graphs
[r,s,t]-colorings of graph products
No full textInternational audienceLet G = (V,E) be a graph with vertex set V and edge set E. Given non negative integers r, s and t, an [r, s, t]-coloring of a graph G is a proper total coloring where the neighboring elements of G (vertices and edges) receive colors with a certain difference r between colors of adjacent vertices, a difference s between colors of adjacent edges and a difference t between colors of a vertex and an incident edge. Thus [r, s, t]-colorings generalize the classical colorings of graphs and can have applications in different fields like scheduling, channel assignment problem, etc. The [r, s, t]-chromatic number of G is the minimum k such that G admits an [r, s, t]-coloring. In our paper we propose several bounds for the [r, s, t]-chromatic number of the cartesian and direct products of some graphs
[r,s,t]-colorings of graph products
No full textInternational audienceLet G = (V,E) be a graph with vertex set V and edge set E. Given non negative integers r, s and t, an [r, s, t]-coloring of a graph G is a proper total coloring where the neighboring elements of G (vertices and edges) receive colors with a certain difference r between colors of adjacent vertices, a difference s between colors of adjacent edges and a difference t between colors of a vertex and an incident edge. Thus [r, s, t]-colorings generalize the classical colorings of graphs and can have applications in different fields like scheduling, channel assignment problem, etc. The [r, s, t]-chromatic number of G is the minimum k such that G admits an [r, s, t]-coloring. In our paper we propose several bounds for the [r, s, t]-chromatic number of the cartesian and direct products of some graphs
