Wyszukiwarka
Nie znaleźliśmy wyników w zadanych kryteriach!
Ale mamy wyniki w innych katalogach.Filtry
wszystkich: 3249
-
Katalog
- Publikacje 2182 wyników po odfiltrowaniu
- Osoby 82 wyników po odfiltrowaniu
- Wynalazki 19 wyników po odfiltrowaniu
- Projekty 17 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Zespoły Badawcze 7 wyników po odfiltrowaniu
- Kursy Online 109 wyników po odfiltrowaniu
- Wydarzenia 7 wyników po odfiltrowaniu
- Dane Badawcze 825 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: MECHANIZMY TYPU HAT
-
Właściwości strukturalne i mechanizmy przewodnictwa jonowego w domieszkowanych związkach typu ABO4
ProjektyProjekt realizowany w Wydział Fizyki Technicznej i Matematyki Stosowanej zgodnie z porozumieniem UMO-2015/17/N/ST5/02813 z dnia 2016-02-26
-
Beata Krawczyk dr hab.
Osobydr hab. Beata Krawczyk, prof. uczelni Stopnie naukowe, wykształcenie, kwalifikacje Beata Krawczyk uzyskała tytuł magistra biologii na Wydziale Biologii (wówczas: Wydział Biologii i Nauk o Ziemi), Uniwersytetu Gdańskiego w 1986 roku, a doktorat z biologii molekularnej na Wydziale Biologii (wówczas: Wydział Biologii, Geografii i Oceanologii) Uniwersytetu Gdańskiego w 1996 roku. Stopień doktora habilitowanego w zakresie nauk biologicznych...
-
Dariusz Dąbrowski dr hab. inż.
OsobyDariusz Dąbrowski ukończył studia w Instytucie Okrętowym Politechniki Gdańskiej, a w 1987 roku podjął pracę na tej uczelni na stanowisku asystenta w Zakładzie Organizacji Przemysłu Okrętowego w ówczesnym Instytucie Organizacji i Projektowania Systemów Produkcyjnych. W 1990 roku wyjechał na stypendium TEMPUS, UE, i spędził 14 miesięcy na Uniwersytecie w Sheffield, gdzie uczestniczył w programie Master of Business Administration...
-
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...