- Professor of Computer Science at Temple Universityedit
Research Interests:
Research Interests:
Research Interests:
A cost is defined for demand paging algorithms with respect to a formal stochastic model of program behavior. This cost is shown to exist under rather general assumptions, and a computational procedure is given which makes it possible to... more
A cost is defined for demand paging algorithms with respect to a formal stochastic model of program behavior. This cost is shown to exist under rather general assumptions, and a computational procedure is given which makes it possible to determine the optimal cost and optimal policy for moderate size programs, when the formal model is known and not time dependent. In this latter case it is shown that these computational procedures may be extended to larger programs to obtain arbitrarily close approximations to their optimal policies. In previous models either unwarranted information is assumed beyond the formal model, or the complete stochastic nature of the model is not taken into account.
Research Interests:
Research Interests:
ABSTRACT An enumerative algorithm is presented for the solution of 0 minus 1 many-knapsack or loading problems. It is based on the principle that before a search is attempted as many decisions as possible should be made about inclusion or... more
ABSTRACT An enumerative algorithm is presented for the solution of 0 minus 1 many-knapsack or loading problems. It is based on the principle that before a search is attempted as many decisions as possible should be made about inclusion or exclusion of objects from the knapsacks. This is accomplished by the introduction of a new ordering relation among the objects. This ordering relation, coupled with other relations, allows a drastic reduction in the extent of the search required to determine a solution.
Research Interests:
lames Korsh has been interested in the analysis of algorithms and is currently completing o book on data structures. Gary Laison" s computer science research interests include analysis of algorithms and theory of... more
lames Korsh has been interested in the analysis of algorithms and is currently completing o book on data structures. Gary Laison" s computer science research interests include analysis of algorithms and theory of computation. ABSTRACT: A technique allowing multiple stacks (or any type of variable length linear lies) to share sequential memory locations is discus~ and simulation results are presented.
Research Interests:
Research Interests:
The generation of all members of a combinatorial family, such as permutations, partitions of an integer or binary trees with n nodes, has long been of interest in the computer science community. The development of loopless algorithms for... more
The generation of all members of a combinatorial family, such as permutations, partitions of an integer or binary trees with n nodes, has long been of interest in the computer science community. The development of loopless algorithms for such generation has been of more recent concern. This paper is an introduction to the idea and development of loopless algorithms. It
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
ABSTRACT An enumerative algorithm is presented for the solution of 0 minus 1 many-knapsack or loading problems. It is based on the principle that before a search is attempted as many decisions as possible should be made about inclusion or... more
ABSTRACT An enumerative algorithm is presented for the solution of 0 minus 1 many-knapsack or loading problems. It is based on the principle that before a search is attempted as many decisions as possible should be made about inclusion or exclusion of objects from the knapsacks. This is accomplished by the introduction of a new ordering relation among the objects. This ordering relation, coupled with other relations, allows a drastic reduction in the extent of the search required to determine a solution.
Research Interests:
ABSTRACT
Research Interests:
Research Interests:
Research Interests:
Research Interests:
... Introduction This note presents an algorithm for obtaining a partial solution to the knapsack problem: ( 1 ) maximize Zi1 cixi subject to: ... These sub-sets, I, and Io, transform the original knapsack problem into the reduced form:... more
... Introduction This note presents an algorithm for obtaining a partial solution to the knapsack problem: ( 1 ) maximize Zi1 cixi subject to: ... These sub-sets, I, and Io, transform the original knapsack problem into the reduced form: (3) maximize EiE A-I1-Io cixi subject to: ...
Research Interests:
... Thuis the nutmerical weights derived can be interpreted as meastures of the power or infltuenice that individtuals have in ani organizationi. The model is not meant to be generally descriptive of group dynaamics. It cait be uised,... more
... Thuis the nutmerical weights derived can be interpreted as meastures of the power or infltuenice that individtuals have in ani organizationi. The model is not meant to be generally descriptive of group dynaamics. It cait be uised, howeveir, to obtaini a group preference structure ...
Research Interests:
ABSTRACT
Research Interests:
Research Interests:
Research Interests:
Erhlich introduced the concept of generating combinatorial structures in constant time per generated item. Such algorithms are called “loopless” and have been described for many objects. Myers introduced the idea of a basic minimal... more
Erhlich introduced the concept of generating combinatorial structures in constant time per generated item. Such algorithms are called “loopless” and have been described for many objects. Myers introduced the idea of a basic minimal interval order. This paper presents a loopless algorithm for generating basic minimal interval orders.
Research Interests:
Research Interests:
Research Interests:
Canfield and Williamson gave the first loopless algorithm for generating all linear extensions of a poset. It elegantly generates all signed extensions, resulting in each extension appearing somewhere with each sign, but retains only... more
Canfield and Williamson gave the first loopless algorithm for generating all linear extensions of a poset. It elegantly generates all signed extensions, resulting in each extension appearing somewhere with each sign, but retains only every other one independent of its sign. It uses an array for the extension. In this paper we give another loopless algorithm for generating all the linear extensions. It generates each extension only once and uses a list for the extensions.
Research Interests:
... chain tj − 1 = 4 − 1 = 3, so chain 3 belongs to qpredj = q3, node 3. Define chain 0 of T to be the sequence of internal nodes visited by starting at the root and visiting all first children THE COMPUTER JOURNAL, Vol. 45, No. 3, 2002... more
... chain tj − 1 = 4 − 1 = 3, so chain 3 belongs to qpredj = q3, node 3. Define chain 0 of T to be the sequence of internal nodes visited by starting at the root and visiting all first children THE COMPUTER JOURNAL, Vol. 45, No. 3, 2002 Page 3. 366 JF KORSH AND P. LAFOLLETTE ...
... Thuis the nutmerical weights derived can be interpreted as meastures of the power or infltuenice that individtuals have in ani organizationi. The model is not meant to be generally descriptive of group dynaamics. It cait be uised,... more
... Thuis the nutmerical weights derived can be interpreted as meastures of the power or infltuenice that individtuals have in ani organizationi. The model is not meant to be generally descriptive of group dynaamics. It cait be uised, howeveir, to obtaini a group preference structure ...
Research Interests:
Research Interests:
An ordered tree with specified degree sequence and n internal nodes has ai nodes of degree i, where a0=1+∑i=1(i−1)ai and n=∑i=0ai. This paper presents the first loopless algorithm for generating all ordered trees with specified degree... more
An ordered tree with specified degree sequence and n internal nodes has ai nodes of degree i, where a0=1+∑i=1(i−1)ai and n=∑i=0ai. This paper presents the first loopless algorithm for generating all ordered trees with specified degree sequence. It uses a new version of the algorithm for generating multiset permutations. When ak=N, a0=(k−1)N+1, and all other ai's are 0, all N