Nie znaleźliśmy wyników w zadanych kryteriach!
Ale mamy wyniki w innych katalogach.Filtry
wszystkich: 3298
-
Katalog
- Publikacje 2579 wyników po odfiltrowaniu
- Czasopisma 27 wyników po odfiltrowaniu
- Konferencje 11 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 124 wyników po odfiltrowaniu
- Wynalazki 1 wyników po odfiltrowaniu
- Projekty 4 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Aparatura Badawcza 1 wyników po odfiltrowaniu
- Kursy Online 83 wyników po odfiltrowaniu
- Wydarzenia 56 wyników po odfiltrowaniu
- Dane Badawcze 410 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: TEAM%20COMPLEXITY.
-
Team Roles and Team Performance in Small Virtual Software Teams
PublikacjaThe 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 dynamics in emergency surgery teams: results from a first international survey
Publikacja -
Team Performance Management
Czasopisma -
Entropic Measures of Complexity of Short-Term Dynamics of Nocturnal Heartbeats in an Aging Population
PublikacjaTwo 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
Czasopisma -
Structural Heart-The Journal of the Heart Team
Czasopisma -
The Snow Team Problem
PublikacjaWe 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)...
-
A-Team Middleware on a Cluster
Publikacja -
The beauty of architectural complexity
Publikacja -
COMPUTATIONAL COMPLEXITY
Czasopisma