Wyniki wyszukiwania dla: TEAM COMPLEXITY. - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: TEAM COMPLEXITY.

Wyniki wyszukiwania dla: TEAM COMPLEXITY.

  • Building Project and Project Team Characteristics For Creating Hybrid Management Processes

    Publikacja
    • C. Orłowski
    • T. Deręgowski
    • M. Kurzawski
    • A. Ziółkowski
    • B. Chrabski

    - Rok 2016

    This paper introduces a method of building the characteristic of Software Development Project. Project characteristic is determined on the basis of several factors such as the complexity of Software Development Project and Project Team, results of historical projects and information on processes and methodologies, which are implemented in analyzed organizations. Information on project complexity can be applied to many different...

  • The Snow Team Problem

    Publikacja

    - Rok 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)...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Application of foam made of post-consumer pet materials for the construction of footbridges

    Publikacja

    The article presents the possibility of application in civil engineering of highly ecological PET foam, manufactured from 100% recycled plastic packaging. It may find uses in construction of numerous engineering structures, such as pedestrian and cycle footbridges. Properly processed waste from post-consumer PET packaging may constitute a quality structural core for use in multilayered composite materials, commonly referred to...

  • Optymalizacja strategii sieci inteligentnych agentów za pomocą programowania genetycznego w systemie rozproszonym realizującym paradygmat volunteer computing

    Publikacja

    - Rok 2017

    Dynamicznie rosnąca złożoność i wymagania w odniesieniu do rozproszonych systemów informatycznych utrudnia zarządzanie dostępnymi zasobami sprzętowymi i programistycznymi. Z tego powodu celem rozprawy jest opracowanie wielokryterialnej metody programowania genetycznego, która pozwala na optymalizację strategii zespołu inteligentnych agentów programistycznych w zakresie zarządzania systemem realizującym paradygmat volunteer computing....

    Pełny tekst do pobrania w portalu

  • Synchronous black hole search in directed graphs

    Publikacja

    - THEORETICAL COMPUTER SCIENCE - Rok 2011

    The paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...

    Pełny tekst do pobrania w serwisie zewnętrznym