Search results for: infinite game chromatic number - Bridge of Knowledge

Search

Search results for: infinite game chromatic number

Filters

total: 59
filtered: 56

clear all filters


Chosen catalog filters

  • Category

  • Year

  • Options

clear Chosen catalog filters disabled

Search results for: infinite game chromatic number

  • Searching by Heterogeneous Agents

    Publication

    - Year 2019

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

    Full text to download in external service

  • Solvation of ionic liquids based on N-alkyl-N-methylmorpholinium cations in N,N-dimethylformamide and dimethyl sulfoxide – A volumetric and acoustic study

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

    Full text to download in external service

  • Building a Nest by an Automaton

    Publication

    - Year 2019

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

    Full text to download in external service

  • Hidden Tensor Structures

    Publication

    - ENTROPY - Year 2024

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

    Full text available to download

  • Cooperative control in production and logistics

    Publication
    • L. Monostori
    • P. Valckenaers
    • A. Dolgui
    • H. Panetto
    • M. Brdyś
    • B. Csáji

    - ANNUAL REVIEWS IN CONTROL - Year 2015

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

    Full text to download in external service

  • Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees

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

    Full text to download in external service