Search results for: PROBLEM

• Journal of Problem Solving

  Journals

  ISSN: 1932-6246

• International Journal of Creativity and Problem Solving

  Journals

  ISSN: 1598-723X

• Interdisciplinary Journal of Problem-Based Learning

  Journals

  ISSN: 1541-5015

• The maximum edge-disjoint paths problem in complete graphs

  Publication

  • A. Kosowski

  - THEORETICAL COMPUTER SCIENCE - Year 2008

  Rozważ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...

  Full text available to download

• Hat problem on a graph

  Publication

  • M. Krzywkowski

  - Mathematica Pannonica - Year 2010

  The 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...

  Full text available to download

• On the hat problem on a graph

  Publication

  • M. Krzywkowski

  - Opuscula Mathematica - Year 2012

  The 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....

  Full text available to download

• A modified hat problem

  Publication

  • M. Krzywkowski

  - Commentationes Mathematicae - Year 2010

  The 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...

  Full text available to download

• The Protein Folding Problem

  Publication

  • H. Scheraga
  • A. Liwo
  • S. Oldziej
  • C. Czaplewski
  • J. Pillardy
  • J. Lee
  • D. Ripoll
  • J. Vila
  • R. Kazmierkiewicz
  • J. Saunders... and 12 others

  - Year 2006

  Full text to download in external service

• Problem powodzi miejskich

  Publication

  • Z. Suligowski

  - Wiadomości Projektanta Budownictwa - Year 2017

  Zagadnienia związane z powtarzającym się w Polsce zjawiskiem powodzi miejskiej pochodzącej od opadu. Problemy ocen ilościowych. Zagadnienie nadmiernego wpływu przeszłości na podejmowane działania, w efekcie niewłaściwa identyfikacja problemów. Przykład działań podjętych w Gdańsku. Inicjatywa bydgoska.

• The Snow Team Problem

  Publication

  • D. Dereniowski
  • A. Lingas
  • M. Persson
  • D. Osula
  • P. Żyliński

  - Year 2017

  We 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)...

  Full text to download in external service