Wyszukiwarka
Filtry
wszystkich: 3449
-
Katalog
- Publikacje 3316 wyników po odfiltrowaniu
- Czasopisma 8 wyników po odfiltrowaniu
- Konferencje 1 wyników po odfiltrowaniu
- Osoby 24 wyników po odfiltrowaniu
- Wynalazki 2 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Kursy Online 53 wyników po odfiltrowaniu
- Wydarzenia 6 wyników po odfiltrowaniu
- Dane Badawcze 37 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: VARIATION OF HAT PROBLEM
-
A modified hat problem
PublikacjaThe topic of our paper is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. There are known many...
-
Hat problem on a graph
PublikacjaThe topic of our paper is the hat problem. In that problem, each of n people is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...
-
On the hat problem on a graph
PublikacjaThe topic of this paper is the hat problem in which each of n players is uniformly and independently fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning....
-
A more colorful hat problem
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. We consider a generalized hat...
-
Hat problem on odd cycles
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. In this version every player can...
-
Hat problem on the cycle C4
PublikacjaThe topic of our paper is the hat problem. In that problem, each of n people is randomly tted with a blue or red hat. Then everybody can try to guess simultanously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...
-
On the Hat Problem on the Cycle C7
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. In this version every player can...
-
On the hat problem, its variations, and their applications
PublikacjaThe topic of our paper is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. There are known many...
-
The hat problem on a union of disjoint graphs
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
A construction for the hat problem on a directed graph
PublikacjaA team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...
-
The hat problem on cycles on at least nine vertices
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Marek Czachor prof. dr hab.
Osoby -
The maximum edge-disjoint paths problem in complete graphs
PublikacjaRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
Elective design I: Waterfront Areas in a Changing Climate – Solutions for Gdańsk
Kursy OnlineElective design I:Waterfront Areas in a Changing Climate – Solutions for Gdańsk for MSc in Arch. Seminars & assignments: 30 hTeacher: Lucyna Nyka, Jakub Szczepański, Justyna Borucka + assist. teacher from Gdańsk Tech Waterfront Areas in a Changing Climate – Solutions for Gdańsk – This course explores challenges, conflicts and concepts in waterfront areas, their connection to architectural and urban design in the time of...
-
Degree of entaglement as a physically ill-posted problem: The case of entaglement with vacuum
PublikacjaAnalizujemy przypadek fotonu w superpozycji różnych modów i zadajemy pytanie o stopień ich splątania z próżnią. Problem okazuje się być źle postawiony, gdyż nie wiemy którą reprezentację algebry CCR wybrać dla kwantowania pola. Gdy dokonamy wyboru jednoznacznie możemy rozwiązać zagadnienie splątania. Tak więc trudność nie leży w matematyce lecz w fizyce problemu.
-
20232024_Elective design II_CULTURAL HERITAGE ROUTES_Gdańsk Measuring the city, advanced digital surveying techniques for cultural heritage documentation
Kursy OnlineCultural Heritage Routes – Gdańsk. This course explores challenges, conflicts and concepts of cultural heritage preservation and protection at urban level, their connection to architectural and urban design in the time of digitalisation and their importance for a future of the cities. The aim of this course, based on the case study city of Gdańsk, is to understand the problem of cultural heritage and develop innovative...
-
SUMMER SCHOOL: Arch Drawing 2/ Elective design II: CULTURAL HERITAGE ROUTES – GDAŃSK FORTIFICATION SYSTEM _2023
Kursy OnlineCultural Heritage Routes – Gdańsk Fortification System This course explores challenges, conflicts and concepts of cultural heritage preservation and protection in urban level, their connection to architectural and urban design in the time of digitalisation and their importance for a future of the cities. The aim of this course, based on the case study city of Gdańsk, is to understand the problem of cultural heritage and...
-
20232024_Elective design II_CULTURAL HERITAGE ROUTES_Gdańsk Drawing architecture to understand the city
Kursy OnlineCultural Heritage Routes – Gdańsk. This course explores challenges, conflicts and concepts of cultural heritage preservation and protection at urban level, their connection to architectural and urban design in the time of digitalisation and their importance for a future of the cities. The aim of this course, based on the case study city of Gdańsk, is to understand the problem of cultural heritage and develop innovative...
-
20232024_Elective design II_CULTURAL HERITAGE ROUTES_Gdańsk Virtual scenarios for city storytelling
Kursy OnlineCultural Heritage Routes – Gdańsk. This course explores challenges, conflicts and concepts of cultural heritage preservation and protection in urban level, their connection to architectural and urban design in the time of digitalisation and their importance for a future of the cities. The aim of this course, based on the case study city of Gdańsk, is to understand the problem of cultural heritage and develop innovative...
-
Linguistic Variation
Czasopisma -
Bifurcation in von Karman problem for rectangular, thin, elastic plate resting on elastic foundation of Winkler type
PublikacjaPraca poświęcona jest utracie stateczności prostokątnej, cienkiej płyty sprężystej spoczywającej na podłożu liniowo sprężystym typu Winklera. Płyta jest ściskana równomiernie rozłożonymi obciążeniami na dwóch równoległych brzegach. Wyznaczono obciążenia krytyczne, formy utraty stateczności płyty oraz początkowe zachowanie pokrytyczne. Analizę prowadzono za pomocą analizy funkcjonalnej przy zachowaniu precyzyjnego matematycznego...
-
Journal of Problem Solving
Czasopisma -
Application of the Mathar method to identify internal stress variation in steel as a welding process result
PublikacjaThe paper deals with the method to identify internal stresses in two-dimensional steel members. Steel members were investigated in the delivery stage and after assembly, by means of electric-arc welding. In order to perform the member assessment two methods to identify the stress variation were applied. The first is a non-destructive measurement method employing local external magnetic field and to detecting the induced voltage,...
-
Density functional approaches to the many-body problem
Kursy Online -
Human Genome Variation
Czasopisma -
Studies in Language Variation
Czasopisma -
Language Variation and Change
Czasopisma -
Equitable colorings of some variation of corona products of cubic graphs
PublikacjaThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
Analysis of the Water Level Variation at the Polish Part of the Vistula Lagoon (2008-2017)
Dane BadawczeThe dataset consists of the following data:
-
Improved top hat and ushaped resistors for huigh precision laser trimming.
PublikacjaPrzedstawiono nowe podejście do poprawy charakterystyk strojenia rezystorów warstwowych typu ''kapelusza'' i typu ''U'' z cięciem prostym pośrodku struktury polegająca na wprowadzeniu zaworki przewodzącej w górnej części rezystora. Umożliwia to eliminację lokalnych przegrzewów oraz zwiększenia dokładności strojenia i wzrostu stabilności.
-
Variation in global uptake of the Surgical Safety Checklist
Publikacja -
The Use of an Autoencoder in the Problem of Shepherding
PublikacjaThis paper refers to the problem of shepherding clusters of passive agents consisting of a large number of objects by a team of active agents. The problem of shepherding and the difficulties that arise with the increasing number of data describing the location of agents have been described. Several methods for reducing the dimensionality of data are presented. Selected autoencoding method using a Restricted Boltzmann Machine is...
-
Cross-cultural problem of quality
PublikacjaThe paper, by presenting issues such as variability of reality, quality of life, quality and environmental management systems, emphasizes the opportunities of taking the socially important problem under control by utilization of efficient quality engineering analytical methods.
-
Decisional DNA and Optimization Problem
PublikacjaMany researchers have proved that Decisional DNA (DDNA) and Set of Experience Knowledge Structure (SOEKS or SOE) is a technology capable of gathering information and converting it into knowledge to help decision-makers to make precise decisions in many ways. These techniques have a feature to combine with different tools, such as data mining techniques and web crawlers, helping organization collect information from different sources...
-
Asia-Pacific Language Variation
Czasopisma -
Problem awarii nowobudowanej kanalizacji
PublikacjaAwaria nowobudowanej i odebranej kanalizacji. Rzetelność projektanta, kierownika budowy i inspektora nadzoru. Ocena zagrożeń dla procesu budowlanego. Błędy działań naprawczych. Szczególny problem projektanta i wykonawcy wywodzących się zer środowiska "melioracji rolnych". Zagrożenia finansowe w sytuacji braku trwałego efektu inwestycji.
-
The Backbone Coloring Problem for Small Graphs
PublikacjaIn this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified...
-
Quantum morphogenesis: A variation on Thom`s catastrophe theory.
PublikacjaZaproponowano nowy opis morfogenezy na poziomie kwantowym w oparciu o rozwiązania samo przełączające nieliniowego równania von Neumanna.
-
Curb-to-Barrier Face Distance Variation an a TB51 Bridge Barrier Crash Test Simulation
PublikacjaThis paper addresses the problem of road safety regarding barrier placement as relative to the curb. A short summary of existing regulations is presented. Numerical simulations using the explicit finite element system Ls- Dyna are shown. In the analysis, variable distance between the barrier and the curb is assumed. The obtained result reveals that the distance has little impact on the working width of the barrier.
-
Asymmetric Renyi Problem and > PATRICIA Tries
PublikacjaIn 1960 R´enyi asked for the number of random queries necessary to recover a hidden bijective labeling of n distinct objects. In each query one selects a random subset of labels and asks, what is the set of objects that have theselabels? Weconsider here anasymmetric version of the problem in which in every query an object is chosenwith probability p > 1/2 and we ignore “inconclusive” queries. We study the number of queries needed...
-
Elective design I: Cultural Heritage Routes – Gdańsk Fortification System - 2022/2023 Project PROMETHEUS
Kursy OnlineElective design I:Cultural Heritage Routes – Gdańsk Fortification Systemfor MSc in Arch. Seminars & assignments: 30 hTeacher: akub Szczepański, Justyna Borucka, Robert Hirsch Piotr Samól, Szymon Kowalski, Joanna Badach + Visiting Prof. Sandro Parrinello (from Pavia University) Cultural Heritage Routes – Gdańsk Fortification System This course explores challenges, conflicts and concepts of cultural heritage preservation...
-
International Journal of Creativity and Problem Solving
Czasopisma -
Interdisciplinary Journal of Problem-Based Learning
Czasopisma -
An adaptive approach to the problem of collision avoiding at sea
PublikacjaW referacie przedstawiono koncepcję podejścia adaptacyjnego do unikania kolizji na morzu. Omawiany problem został sklasyfikowany jako problem uczenia się ze wzmocnieniem. Zamieszczono opis podstawowych technik uczenia się ze wzmocnieniem, ich ograniczeń i sposobu w jaki można zapewnić efektywne uczenie się, mimo wspomnianych ograniczeń. Zaprezentowana metoda została zilustrowana przykładowym procesem konstrukcji modelu i algorytmami...
-
Variation in productivity of Ipomoea batatas at various rates of nitrogen fertilization
Publikacja -
Analysis of the Water Level Variation in the Polish Part of the Vistula Lagoon (Baltic Sea) and Estimation of Water Inflow and Outflow Transport through the Strait of Baltiysk in the Years 2008–2017
PublikacjaThe Vistula Lagoon is located in both Poland and Russia along the southern coast of the Baltic Sea. It is connected to the Baltic Sea in the Russian part by the Strait of Baltiysk. The purpose of the paper is to identify the dominant factors underlying the water level variation mechanism at Tolkmicko in the Vistula Lagoon, revealed by a statistical analysis of the measured data and a discussion on the inflow and outflow transport...
-
Can we really solve an arch stability problem?
PublikacjaWe bring attention to the problem of solving nonlinear boundary-value problems for elastic structures such as arches and shells. Here we discuss a classical problem of a shear-deformable arch postbuckling. Considering a postbuckling behaviour of a circular arch we discuss the possibility to find numerically a solution for highly nonlinear regimes. The main attention is paid to the problem of determination of all solutions. The...
-
Selection Pressure in the Evolutionary Path Planning Problem
PublikacjaThis article compares an impact of using various post-selection methods on the selection pressure and the quality of the solution for the problem of planning the path for a moving object using the evolutionary method. The concept of selection pressure and different methods of post-selection are presented. Article analyses behaviour of post-selection for four options of evolutionary algorithms. Based on the results achieved, waveform...
-
The searchlight problem for road networks
PublikacjaWe consider the problem of searching for a mobile intruder hiding in a road network given as the union of two or more lines, or two or more line segments, in the plane. Some of the intersections of the road network are occupied by stationary guards equipped with a number of searchlights, each of which can emit a single ray of light in any direction along the lines (or line segments) it is on. The goal is to detect the intruder,...
-
Application of genetic algorithms in graph searching problem
PublikacjaGraph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...