Filtry
wszystkich: 3162
wybranych: 2469
-
Katalog
- Publikacje 2469 wyników po odfiltrowaniu
- Czasopisma 27 wyników po odfiltrowaniu
- Konferencje 11 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 117 wyników po odfiltrowaniu
- Wynalazki 1 wyników po odfiltrowaniu
- Projekty 2 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Aparatura Badawcza 1 wyników po odfiltrowaniu
- Kursy Online 82 wyników po odfiltrowaniu
- Wydarzenia 55 wyników po odfiltrowaniu
- Dane Badawcze 395 wyników po odfiltrowaniu
Filtry wybranego katalogu
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 -
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...
-
A-Team Middleware on a Cluster
Publikacja -
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)...
-
The beauty of architectural complexity
Publikacja -
Web Accessible A-Team Middleware
Publikacja -
To Work or Not to Work… in a Multicultural Team?
PublikacjaThe 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...
-
Electron-beam irradiation in TEM of hard-segment homopolymers and polyurethanes with different hard-segment content.
PublikacjaZbadano 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...
-
The complexity of bicriteria tree-depth
PublikacjaThe 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...
-
The complexity of node blocking for dags
PublikacjaRozważ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...
-
On the complexity of distributed greedy coloring
PublikacjaW 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.
-
The complexity of list ranking of trees
PublikacjaUporzą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...
-
The clinical complexity of patients with acromegaly
Publikacja -
Complexity of resilient network optimisation
Publikacja -
On the complexity of resilient network design
Publikacja -
Management of complexity and information flow
PublikacjaProblemy 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.
-
Influence of the Working Strategy on A-Team Performance
Publikacja -
Complexity Issues on of Secondary Domination Number
PublikacjaIn 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...
-
The Complexity of Zero-Visibility Cops and Robber
PublikacjaIn 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
PublikacjaWe 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
PublikacjaWe 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 of a classical flow restoration problem
Publikacja -
The complexity of equitable vertex coloring graphs
PublikacjaW 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.
-
Fuzzy Methods and Models for a Team-Building Process
PublikacjaThis 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...
-
e-JABAT – An Implementation of the Web-Based A-Team
Publikacja -
A Cross-Team Collaborative Evaluation of a CRM System
PublikacjaThis 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...
-
Edge and Pair Queries-Random Graphs and Complexity
PublikacjaWe 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.
-
Clinical complexity – where to find it and how to use it
Publikacja -
Complexity of weak acceptonic conditions in tree automata
PublikacjaRozważ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.
-
Project Team Management Supported by an Agent-Based Model
PublikacjaThis work is a continuation of a series of works about research into the use of multi-agent systems to support IT project management. Previous studies have shown the possibility of using a multi-agent in order to optimize management decisions concerning the selection of methods for project implementation. It was noted that the project manager's decisions are influenced by three fundamental parameters: the entropy of the project,...
-
On the Agile Mindset of an Effective Team – An Industrial Opinion Survey
PublikacjaIn this paper we present the results of an opinion survey among 52 agile practitioners who evaluated the importance of 26 selected elements of the agile mindset to the effectiveness of an agile team. In total, we have identified 70 unique agile mindset elements based on 11 literature sources and 5 interviews with industry experts. 7 elements belonged to the “support for business goals” category, 20 to the “relationships within...
-
Chest Injuries Based on Medical Rescue Team Data
Publikacja -
Acute coronary syndromes in the practice of the emergency medical team
Publikacja -
The complexity of the T-coloring problem for graphs with small degree
Publikacja -
Some results concerning the complexity of restricted colorings of graphs
Publikacja -
Scheduling jobs to contain a natural disaster: a model and complexity
Publikacjathis paper is devoted to the problem of scheduling suppression units so that a natural disaster is dealt with as efficient as possible. the concept of deteriorating jobs is adopted, that is, the formal model of scheduling represents linearly increasing value loss as the disaster remains unsuppressed and increasing time for its suppression. more precisely, two different goals are considered: finding a suppression schedule of minimal...
-
The laws of thermodynamics: entropy, free energy, information and complexity
PublikacjaW rozdziale przedstawiono podstawowe Zasady Termodynamiki. Omówiono zagadnienia związane z pojęciem entropii, energii Gibbsa, egzergii oraz systemami złożonymi.
-
On the complexity of distributed graph coloring with local minimality constraints
PublikacjaArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Omówiono algorytmy rozproszone, dające w wyniku pokolorowanie spełniające warunki dla pokolorowań sekwencyjnych typu S oraz Largest-First (LF). Udowodniono również, że każda rozproszona implementacja algorytmu S wymaga co najmniej Omega(log n / log log n) rund, a algorytmu LF co najmniej Omega (n^{1/2}) rund, gdzie n oznacza liczbę wierzchołków grafu.
-
Smart systems integration: toward overcoming the problem of complexity
PublikacjaW pracy omówiono modelowa propozycję integracji systemu opartą na zastosowaniu sztucznej inteligencji w celu rozwiązania problemu złożoności systemowej.
-
Review of the Complexity of Managing Big Data of the Internet of Things
PublikacjaTere is a growing awareness that the complexity of managing Big Data is one of the main challenges in the developing feld of the Internet of Tings (IoT). Complexity arises from several aspects of the Big Data life cycle, such as gathering data, storing them onto cloud servers, cleaning and integrating the data, a process involving the last advances in ontologies, such as Extensible Markup Language (XML) and Resource Description...
-
ANALYSIS OF EFFECTIVENESS AND COMPUTATIONAL COMPLEXITY OF TREND REMOVAL METHODS
PublikacjaThe paper presents a method of processing measurement data due to remove slowly varying component of the trend occurring in the recorded waveforms. Comparison of computational complexity and trend removal efficiency between some commonly used methods is presented. The impact of these procedures on probability distribution and power spectral density is shown. Effectiveness and computational complexity of these methods depend essentially...
-
The complexity of the T-coloring problem for graphs with small degree.
PublikacjaW pracy ustalono złożoność obliczeniową problemu optymalnego kolorowania grafów o ustalonym stopniu.
-
GROUP COMPOSER - System for Modeling Agents’ Team Building for Tasks
PublikacjaMulti-agent systems consist of many autonomous units, called agents, that can interact when trying to achieve their goals. The selection of interaction partners is called team formation. Three basic approaches can be considered to match multi-agent system resources to the problem at hand. To research the properties of different approaches, a software for modeling team formation in multi-agent systems has been created and is presented...
-
The Structure of Entrepreneurial Team Members’ Competencies: Between Effectuation and Causation
PublikacjaA conscious shaping of entrepreneurial competence is a relevant element of entrepreneurial education. In order to recognize which of the competencies regarded as entrepreneurial are characteristic of members of entrepreneurial teams, which is crucial for the work of those teams, it is necessary to identify the structure of those competencies. This quantitative study was conducted with the use of a survey method and involved 111...
-
An A-Team Approach to Learning Classifiers from Distributed Data Sources
Publikacja -
An A-Team approach to learning classifiers from distributed data sources
Publikacja -
JADE-Based A-Team as a Tool for Implementing Population-Based Algorithms
Publikacja -
Teams tools. Leading high-performance teams with different types of intelligence
PublikacjaThe subject of this paper is the analysis of necessary tools for global teams, image of the team leader, styles of leadership in global teams. The analysis is based on selected examples from high-performance teams with visible results. The purpose of the work is to answer for the following questions: What are the characteristics of the leading global teams? Which style of leadership use the global teams? Is a female leader different...
-
Remarks on steam condensation modeling related to steam turbine large output
PublikacjaIn the paper numerical simulations have been performed to predict the performance of the diferent steam models. All of the considered models of steam condensation have been validated on the base of benchmark experiment employing expansion in nozzle and next on the low pressure part of the steam turbine equipped with the so-called Baumann stage. For numerical analysis three models have been finally used - the ideal steam model without...