Wyszukiwarka
Wyniki wyszukiwania dla: INFINITE GAME CHROMATIC NUMBER
-
Searching by heterogeneous agents
PublikacjaIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances...
-
Searching by Heterogeneous Agents
PublikacjaIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs. In such setting a searcher, once a search strategy initially decides on the label of the searcher, can be present on an edge only if the label of the searcher and the label of the edge are the same. We prove...
-
Solvation of ionic liquids based on N-alkyl-N-methylmorpholinium cations in N,N-dimethylformamide and dimethyl sulfoxide – A volumetric and acoustic study
PublikacjaApparent molar volumes and molar isentropic compressibilities for N-ethyl-N-methylmorpholinium and N-decyl-N-methylmorpholinium tetrafluoroborates in N,N-dimethylformamide (DMF) and dimethyl sulfoxide (DMSO) have been determined from density and speed of sound measurements over the temperature range T = (298.15, 303.15, 308.15, 313.15, 318.15 and 328.15) K at experimental pressure p = 0.1 MPa. This data has been used to calculate...
-
Building a Nest by an Automaton
PublikacjaA robot modeled as a deterministic finite automaton has to build a structure from material available to it. The robot navigates in the infinite oriented grid $Z x Z$. Some cells of the grid are full (contain a brick) and others are empty. The subgraph of the grid induced by full cells, called the {\em field}, is initially connected. The (Manhattan) distance between the farthest cells of the field is called its {\em span}. The robot...
-
Hidden Tensor Structures
PublikacjaAny single system whose space of states is given by a separable Hilbert space is automatically equipped with infinitely many hidden tensor-like structures. This includes all quantum mechanical systems as well as classical field theories and classical signal analysis. Accordingly, systems as simple as a single one-dimensional harmonic oscillator, an infinite potential well, or a classical finite-amplitude signal of finite duration...
-
Measurements of the mechanical system properties of "SpeedLine magnetic" ultra-fast robot prototype for IML labeling
Dane BadawczeThe mechanical system tests of the high-speed IML labeling robot "SpeedLine Magnetic" were carried out in order to analyze the effects of the drive system's operating parameters on vibration and noise.
-
Cooperative control in production and logistics
PublikacjaClassical applications of control engineering and information and communication technology (ICT) in production and logistics are often done in a rigid, centralized and hierarchical way. These inflexible approaches are typically not able to cope with the complexities of the manufacturing environment, such as the instabilities, uncertainties and abrupt changes caused by internal and external disturbances, or a large number and variety...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublikacjaAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...