Zeitschriften und Ausgaben

Volumen 9 (2022): Heft 16 (June 2022)

Volumen 8 (2021): Heft 15 (November 2021)

Volumen 8 (2021): Heft 14 (October 2021)

Volumen 7 (2020): Heft 13 (November 2020)

Volumen 6 (2019): Heft 12 (December 2019)

Volumen 6 (2019): Heft 11 (September 2019)

Volumen 5 (2018): Heft 10 (December 2018)

Volumen 5 (2018): Heft 9 (September 2018)

Volumen 4 (2017): Heft 8 (December 2017)

Volumen 4 (2017): Heft 7 (May 2017)

Volumen 3 (2016): Heft 6 (December 2016)

Volumen 3 (2016): Heft 5 (March 2016)

Zeitschriftendaten
Format
Zeitschrift
eISSN
2182-1976
Erstveröffentlichung
16 Apr 2016
Erscheinungsweise
2 Hefte pro Jahr
Sprachen
Englisch

Suche

Volumen 8 (2021): Heft 15 (November 2021)

Zeitschriftendaten
Format
Zeitschrift
eISSN
2182-1976
Erstveröffentlichung
16 Apr 2016
Erscheinungsweise
2 Hefte pro Jahr
Sprachen
Englisch

Suche

4 Artikel
Uneingeschränkter Zugang

Bishop Independence on the Surface of a Square Prism

Online veröffentlicht: 07 Dec 2021
Seitenbereich: 1 - 12

Zusammenfassung

Abstract

Bishop Independence concerns determining the maximum number of bishops that can be placed on a board such that no bishop can attack any other bishop. This paper presents the solution to the bishop independence problem, determining the bishop independence number, for all sizes of boards on the surface of a square prism.

MSC 2010

  • 05C69
  • 00A08
Uneingeschränkter Zugang

Diameter-Separation of Chessboard Graphs

Online veröffentlicht: 07 Dec 2021
Seitenbereich: 13 - 26

Zusammenfassung

Abstract

We define the queens (resp., rooks) diameter-separation number to be the minimum number of pawns for which some placement of those pawns on an n × n board produces a board with a queens graph (resp., rooks graph) with a desired diameter d. We determine these numbers for some small values of d.

Uneingeschränkter Zugang

Adjustable Coins

Online veröffentlicht: 07 Dec 2021
Seitenbereich: 27 - 39

Zusammenfassung

Abstract

In this paper we consider a scenario where there are several algorithms for solving a given problem. Each algorithm is associated with a probability of success and a cost, and there is also a penalty for failing to solve the problem. The user may run one algorithm at a time for the specified cost, or give up and pay the penalty. The probability of success may be implied by randomization in the algorithm, or by assuming a probability distribution on the input space, which lead to different variants of the problem. The goal is to minimize the expected cost of the process under the assumption that the algorithms are independent. We study several variants of this problem, and present possible solution strategies and a hardness result.

Uneingeschränkter Zugang

Who is Guilty?

Online veröffentlicht: 07 Dec 2021
Seitenbereich: 41 - 52

Zusammenfassung

Abstract

We discuss a generalization of logic puzzles in which truth-tellers and liars are allowed to deviate from their pattern in case of one particular question: “Are you guilty?”

4 Artikel
Uneingeschränkter Zugang

Bishop Independence on the Surface of a Square Prism

Online veröffentlicht: 07 Dec 2021
Seitenbereich: 1 - 12

Zusammenfassung

Abstract

Bishop Independence concerns determining the maximum number of bishops that can be placed on a board such that no bishop can attack any other bishop. This paper presents the solution to the bishop independence problem, determining the bishop independence number, for all sizes of boards on the surface of a square prism.

MSC 2010

  • 05C69
  • 00A08
Uneingeschränkter Zugang

Diameter-Separation of Chessboard Graphs

Online veröffentlicht: 07 Dec 2021
Seitenbereich: 13 - 26

Zusammenfassung

Abstract

We define the queens (resp., rooks) diameter-separation number to be the minimum number of pawns for which some placement of those pawns on an n × n board produces a board with a queens graph (resp., rooks graph) with a desired diameter d. We determine these numbers for some small values of d.

Uneingeschränkter Zugang

Adjustable Coins

Online veröffentlicht: 07 Dec 2021
Seitenbereich: 27 - 39

Zusammenfassung

Abstract

In this paper we consider a scenario where there are several algorithms for solving a given problem. Each algorithm is associated with a probability of success and a cost, and there is also a penalty for failing to solve the problem. The user may run one algorithm at a time for the specified cost, or give up and pay the penalty. The probability of success may be implied by randomization in the algorithm, or by assuming a probability distribution on the input space, which lead to different variants of the problem. The goal is to minimize the expected cost of the process under the assumption that the algorithms are independent. We study several variants of this problem, and present possible solution strategies and a hardness result.

Uneingeschränkter Zugang

Who is Guilty?

Online veröffentlicht: 07 Dec 2021
Seitenbereich: 41 - 52

Zusammenfassung

Abstract

We discuss a generalization of logic puzzles in which truth-tellers and liars are allowed to deviate from their pattern in case of one particular question: “Are you guilty?”

Planen Sie Ihre Fernkonferenz mit Scienceendo