Search
Didn't find any results in this catalog!
But we have some results in other catalogs.Filters
total: 3265
-
Catalog
- Publications 2182 available results
- People 83 available results
- Inventions 19 available results
- Projects 18 available results
- Laboratories 1 available results
- Research Teams 7 available results
- e-Learning Courses 123 available results
- Events 7 available results
- Open Research Data 825 available results
displaying 1000 best results Help
Search results for: MECHANIZMY TYPU HAT
-
Structural properties and ionic conduction mechanisms in doped ABO4 oxides
ProjectsProject realized in Faculty of Applied Physics and Mathematics according to UMO-2015/17/N/ST5/02813 agreement from 2016-02-26
-
Beata Krawczyk dr hab.
PeopleBeata Krawczyk, PhD, Professor Academic degrees, education, qualifications: B. Krawczyk earned his master degree in Biology at the University of Gdansk, Biology Faculty, in 1986, and her PhD in Molecular Biology at the University of Gdansk, Biology Faculty, in 1996. Postdoctoral degree (habilitation) in biological sciences in the discipline biology, Faculty of Natural Sciences, University of Szczecin, Szczecin, in 2009. In 2012...
-
Dariusz Dąbrowski dr hab. inż.
PeopleDariusz Dąbrowski graduated from the Faculty of Shipbuilding at Gdańsk University of Technology and in 1987 began working at the university as an assistant in the Department of Shipbuilding Industry Organization within the then Institute of Organization and Design of Production Systems. In 1990, he went on a TEMPUS scholarship from the EU and spent 14 months at the University of Sheffield, where he participated in the Master of...
-
A modified hat problem
PublicationThe 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
PublicationThe 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
PublicationThe 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
PublicationThe 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
PublicationThe 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
PublicationThe 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
PublicationThe 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...