Results 1  10
of
72
THE FELINE JOSEPHUS PROBLEM
"... Abstract. In the classic Josephus problem, elements 1, 2,..., n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consists of traveling around the circle from the current position, and selecting the kth remaining element to be elimin ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. In the classic Josephus problem, elements 1, 2,..., n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consists of traveling around the circle from the current position, and selecting the kth remaining element
The Feline Josephus Problem
"... 60 61 62 63 64 65 Theory of Computing Systems manuscript No. (will be inserted by the editor) ..."
Abstract
 Add to MetaCart
60 61 62 63 64 65 Theory of Computing Systems manuscript No. (will be inserted by the editor)
The Josephus Problem
"... We give explicit nonrecursive formulas to compute the Josephusnumbers j#n; 2;i# and j#n; 3;i# and explicit upper and lower bounds for j#n; k; i# #where k # 4# which di#er by2k,2 #for k = 4 the bounds are even better#. Furthermore we present a new fast algorithm to calculate j#n; k; i# which is bas ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We give explicit nonrecursive formulas to compute the Josephusnumbers j#n; 2;i# and j#n; 3;i# and explicit upper and lower bounds for j#n; k; i# #where k # 4# which di#er by2k,2 #for k = 4 the bounds are even better#. Furthermore we present a new fast algorithm to calculate j#n; k; i# which
The Josephus Problem
 J. Thor. Nombres Bordeaux
, 1997
"... We give explicit nonrecursive formulas to compute the Josephusnumbers j(n; 2; i) and j(n; 3; i) and explicit upper and lower bounds for j(n; k; i) (where k 4) which differ by 2k \Gamma 2 (for k = 4 the bounds are even better). Furthermore we present a new fast algorithm to calculate j(n; k; i) w ..."
Abstract
 Add to MetaCart
) which is based upon the mentioned bounds. 1 Introduction The Josephus problem in its original form goes back to the Roman historian Flavius Josephus (see [3]). In the RomanoJewish conflict of 67 A. D., the Romans took the town Jotapata which Josephus was commanding. He and 40 companions escaped
Functional iteration and the Josephus problem
, 1991
"... this paper we deal with the J q (n)'s. What we have to contribute is the observation that in one of the algorithms that has been proposed for solving the problem, the sequence of numbers that is generated is remarkably well approximated by a single term of its asymptotic series. This result, wh ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
this paper we deal with the J q (n)'s. What we have to contribute is the observation that in one of the algorithms that has been proposed for solving the problem, the sequence of numbers that is generated is remarkably well approximated by a single term of its asymptotic series. This result
Generilizations of the Josephus problem
"... Abstract. This article presents two algorithmic solutions to an extended version of the Josephus problem. In addition, the number of steps required for one of these algorithms is discussed. Finally, a variation on the Josephus problem and an algorithmic solution to this new problem are also given. 1 ..."
Abstract
 Add to MetaCart
Abstract. This article presents two algorithmic solutions to an extended version of the Josephus problem. In addition, the number of steps required for one of these algorithms is discussed. Finally, a variation on the Josephus problem and an algorithmic solution to this new problem are also given
Time Improvement on Josephus Problem
, 2002
"... An algorithm for Josephus Problem has been proposed only the time complexity of O(m+ log m=(m 1) (n=m)). A prealgorithm was used to obtain the best algorithm. By increasing m the algorithm becomes more ecient than the algorithms suggested before. ..."
Abstract
 Add to MetaCart
An algorithm for Josephus Problem has been proposed only the time complexity of O(m+ log m=(m 1) (n=m)). A prealgorithm was used to obtain the best algorithm. By increasing m the algorithm becomes more ecient than the algorithms suggested before.
Josephus Problem Under Various Moduli.
, 2009
"... We are going to study the Josephus Problem and its variants under various moduli in this article. Let n be a natural number. We put n numbers in a circle, and we are going to remove every second number. Let J(n) be the last number that remains. This is the traditional Josephus Problem. The ..."
Abstract
 Add to MetaCart
We are going to study the Josephus Problem and its variants under various moduli in this article. Let n be a natural number. We put n numbers in a circle, and we are going to remove every second number. Let J(n) be the last number that remains. This is the traditional Josephus Problem. The
A Comparative Study on the Algorithms for a Generalized Josephus Problem
, 2013
"... Abstract: The classic Josephus problem can be described as follows: There are n objects, consecutively numbered from 1 through n, arranged in a circle. We are given a positive integer k. Beginning with a designated first object, we proceed around the circle, removing every kth object. After each ob ..."
Abstract
 Add to MetaCart
Abstract: The classic Josephus problem can be described as follows: There are n objects, consecutively numbered from 1 through n, arranged in a circle. We are given a positive integer k. Beginning with a designated first object, we proceed around the circle, removing every kth object. After each
An Overview of Feline
"... Heartworm disease was previously considered a serious clinical problem only in dogs. Recently, however, the incidence of feline heartworm disease appears to be increasing. Factors contributing to this include increased awareness by veterinarians, a wide host preference by the vector, and the real ..."
Abstract
 Add to MetaCart
Heartworm disease was previously considered a serious clinical problem only in dogs. Recently, however, the incidence of feline heartworm disease appears to be increasing. Factors contributing to this include increased awareness by veterinarians, a wide host preference by the vec
Results 1  10
of
72