Search results for: fpt-algorithm - Bridge of Knowledge

Search

Search results for: fpt-algorithm

Search results for: fpt-algorithm

  • Multi-agent graph searching and exploration algorithms

    Publication

    - Year 2020

    A team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...

    Full text available to download

  • Total Completion Time Minimization for Scheduling with Incompatibility Cliques

    Publication

    - Year 2021

    This paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph equivalent to a collection of disjoint cliques. No two jobs in a clique are allowed to be assigned to the same machine. Scheduling with incompatibilities between jobs represents a well-established line of research in scheduling theory and the case of disjoint cliques has received increasing attention in recent...

    Full text to download in external service

  • The Effects of Pin Profile on HDPE Thermomechanical Phenomena during FSW

    Publication

    - Polymers - Year 2022

    Friction stir welding (FSW) of polymeric materials has recently attracted significant attention. Herein, we present the effect of the tool pin profile on the FSW of high-density polyethylene (HDPE) joints through joint experimental analysis and thermomechanical simulations. For analysis of pin profile effects on the thermomechanical properties of HDPE joints, frustum (FPT), cubic (CPT), and triangular (TPT) pin shapes were selected...

    Full text available to download

  • The Snow Team Problem

    Publication

    - Year 2017

    We study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...

    Full text to download in external service