Filters
total: 3339
-
Catalog
- Publications 2603 available results
- Journals 27 available results
- Conferences 11 available results
- Publishing Houses 1 available results
- People 126 available results
- Inventions 1 available results
- Projects 5 available results
- Laboratories 1 available results
- Research Equipment 1 available results
- e-Learning Courses 92 available results
- Events 57 available results
- Open Research Data 414 available results
displaying 1000 best results Help
Search results for: TEAM%20COMPLEXITY.
-
Team Roles and Team Performance in Small Virtual Software Teams
PublicationThe article presents the results of research on the composition of team roles conducted in 24 student software teams. An adaptation of M. Belbin’s model by B. Kożusznik was used. The model of team balance according to Belbin and Haaf is presented and correlations between team balance and team performance are analysed. Team performance is measured at three levels: result, satisfaction and team climate. The selected constellation...
-
Team Performance Management
Journals -
Team dynamics in emergency surgery teams: results from a first international survey
Publication -
Entropic Measures of Complexity of Short-Term Dynamics of Nocturnal Heartbeats in an Aging Population
PublicationTwo entropy-based approaches are investigated to study patterns describing differences in time intervals between consecutive heartbeats. The first method explores matrices arising from networks of transitions constructed following events represented by a time series. The second method considers distributions of ordinal patterns of length three, whereby patterns with repeated values are counted as different patterns. Both methods provide...
-
COMPLEXITY
Journals -
Structural Heart-The Journal of the Heart Team
Journals -
A-Team Middleware on a Cluster
Publication -
The Snow Team Problem
PublicationWe 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)...
-
The beauty of architectural complexity
Publication -
COMPUTATIONAL COMPLEXITY
Journals -
Ecological Complexity
Journals -
JOURNAL OF COMPLEXITY
Journals -
Web Accessible A-Team Middleware
Publication -
To Work or Not to Work… in a Multicultural Team?
PublicationThe main goal of the article is to present research findings regarding student’s attitude to working in a multicultural team (MCT). Research participants of different cultural background completed the research survey. Their willingness to work in MCT was measured together with factors that influence it. These include factors related to both team members and the task structure. Research findings indicate that the respondents preferred...
-
Quantum Beam Science
Journals -
Electron-beam irradiation in TEM of hard-segment homopolymers and polyurethanes with different hard-segment content.
PublicationZbadano odporność na niszczenie radiacyjne w transmisyjnym mikroskopie elektronowym homopolimeru segmentów sztywnych i poliuretanów z różną zawartością segmentów sztywnych. Dokonano rejestracji morfologii tych polimerów w TEM w trakcie obserwacji w jasnym polu oraz selektywnej dyfrakcji elektronowej. Analizowano tkże te polimery w mikroskopie polaryzacyjnym przed i po obserwacjach w TEM. Potwierdzono doniesienia literatutowe o...
-
On the complexity of distributed greedy coloring
PublicationW pracy rozważono problem kolorowania grafów przy dodatkowym założeniu, że kolor żadnego wierzchołka nie może zostać zmniejszony bez zmiany kolorów przynajmniej jednego z jego sąsiadów. Przeprowadzone rozważania dotyczyły złożoności obiczeniowej problemu w modelu Liniala obliczeń rozproszonych. Podano ograniczenia dolne i górne złożoności problemu oraz zestawiono problem z innymi pokrewnymi zagadnieniami grafowymi.
-
Complexity of resilient network optimisation
Publication -
On the complexity of resilient network design
Publication -
The clinical complexity of patients with acromegaly
Publication -
The complexity of list ranking of trees
PublicationUporządkowane kolorowanie grafu polega na takim etykietowaniu jego wierzchołków, aby każda ścieżka łącząca dwa wierzchołki o tym samym kolorze zawierała wierzchołek o kolorze wyższym. Jeśli każdy wierzchołek posiada dodatkowo listę dozwolonych dla niego etykiet, to mówimy wówczas o uporządkowanym listowym kolorowaniu wierzchołków. W pracy wskazano szereg klas grafów, dla których problem jest trudny: pełne drzewa binarne, drzewa...
-
Management of complexity and information flow
PublicationProblemy złożoności i zarządzania przepływem informacji. W rozdziale omówio-no podejście do modelowania systemów złożonych oraz zarządzania przepływeminformacji w takich systemach. Rozwiązania odniesiono do płaszczyzny elasty-cznego wytwarzania. Poruszono aspekty miękkiego modelowania w takich środo-wiskach.
-
The complexity of node blocking for dags
PublicationRozważamy następującą grę (pomiędzy dwoma graczami) kombinatoryczną o nazwie ''node blocking''. Dany jest graf skierowany. Każdy wierzchołek może być zajęty przez co najwyżej jeden token. Wyróżniamy dwa kolory tokenów, biały i czarny, każdy gracz może przemieszczać tylko własne tokeny. Gracze wykonują ruchy naprzemiennie. Ruch polega na wyborze dowolnego tokena własnego koloru i przesunięciu go na dowolnego niezajętego przez inny...
-
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Influence of the Working Strategy on A-Team Performance
Publication -
Complexity of a classical flow restoration problem
Publication -
The complexity of equitable vertex coloring graphs
PublicationW artykule podajemy wzory na sprawiedliwą liczbę chromatyczną niektórych produktów grafowych. Ponadto przedstawiamy dwa algorytmy wielomianowe dla sprawiedliwego kolorowania grafów suboptymalną liczba kolorów.
-
The Complexity of Zero-Visibility Cops and Robber
PublicationIn this work we deal with the computational complexity aspects of the zero-visibility Cops and Robber game. We provide an algorithm that computes the zero-visibility copnumber of a tree in linear time and show that the corresponding decision problem is NP-complete even for the class of starlike graphs.
-
The complexity of minimum-length path decompositions
PublicationWe consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...
-
The complexity of zero-visibility cops and robber
PublicationWe consider the zero-visibility cops & robber game restricted to trees. We produce a characterisation of trees of copnumber k and We consider the computational complexity of the zero-visibility Cops and Robber game. We present a heavily modified version of an already-existing algorithm that computes the zero-visibility copnumber of a tree in linear time and we show that the corresponding decision problem is NP-complete on a nontrivial...
-
Complexity Issues on of Secondary Domination Number
PublicationIn this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...
-
e-JABAT – An Implementation of the Web-Based A-Team
Publication -
Fuzzy Methods and Models for a Team-Building Process
PublicationThis chapter contains an introduction to fuzzy-logic model-based approaches for a team-building process. Such appraches allow extending typical recruiting practice and selection processes to enable a wider and more precise assessment of a new team and/or existing team members, taking into account both their hard and soft skills. Moreover, as effectiveness of teams depends on the interpersonal skills and emotional intelligence...
-
A Cross-Team Collaborative Evaluation of a CRM System
PublicationThis paper presents an analysis of an usability evaluation a CRM (Customer Relationship Management) performed by a team composed of external usability experts jointly with a CRM staff. The evaluation process differed from a classical scheme known from former projects, including some new elements resulting from a specific context of this study. These novel elements resulted in reshaping the role of the CRM system and considering...
-
Groups Complexity Cryptology
Journals -
EMERGENCE-Complexity & Organization
Journals -
Strength Fracture and Complexity
Journals -
Discontinuity, Nonlinearity, and Complexity
Journals -
Journal of Physics-Complexity
Journals -
Economic Complexity and Evolution
Journals -
Geam-Geoingegneria Ambientale e Mineraria-Geam-Geoengineering Environment and Mining
Journals -
Annals of Long-Term Care
Journals -
Journal of Long-Term Care
Journals -
Journal of Tea Science
Journals -
Clinical complexity – where to find it and how to use it
Publication -
Complexity of weak acceptonic conditions in tree automata
PublicationRozważano złożoność problemu pustości dla automatów na drzewach ze słabymi warunkami akceptowalności. Rozważano także translacje pomiędzy słabymi i silnymi warunkami akceptowalności.
-
Edge and Pair Queries-Random Graphs and Complexity
PublicationWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
Wydziałowy Team Biegowy ZiE
EventsW niedzielę, 23.10.2016 r. w trakcie VIII edycji Gdańsk Biega, pracownicy WZiE wystartowali pod wspólnym szyldem Wydziałowy Team Biegowy ZiE. Klub zrzesza 5 aktualnych maratończyków. Imprezie patronuje dziekan WZiE.
-
Students’ Team Project Experiences and Their Attitudes Towards Teamwork
Publication -
Chest Injuries Based on Medical Rescue Team Data
Publication