All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Bounded Suboptimal Token Swapping

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F20%3A00345317" target="_blank" >RIV/68407700:21240/20:00345317 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/ICTAI50040.2020.00186" target="_blank" >https://doi.org/10.1109/ICTAI50040.2020.00186</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ICTAI50040.2020.00186" target="_blank" >10.1109/ICTAI50040.2020.00186</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Bounded Suboptimal Token Swapping

  • Original language description

    oken swapping (TSWAP) represents a challenging problem underlying in many practical applications ranging from item relocation to quantum program compilation. In TSWAP, we are given an undirected graph with colored vertices. A colored token is placed in each vertex. A pair of tokens can be swapped between a pair of adjacent vertices. The goal is to perform a sequence of swaps so that token and vertex colors agree across the graph. The total number of swaps is usually required to be small. We study bounded sub-optimal algorithms for solving the TSWAP problem.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA19-17966S" target="_blank" >GA19-17966S: intALG-MAPFg: Intelligent Algorithms for Generalized Variants of Multi-Agent Path Finding</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2020

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence

  • ISBN

    978-1-7281-9228-4

  • ISSN

    2375-0197

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    1233-1240

  • Publisher name

    IEEE Computer Society

  • Place of publication

    Los Alamitos

  • Event location

    Virtualni

  • Event date

    Nov 9, 2020

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article