We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the mediu...
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
In 1990, J.L. Krivine introduced the notion of storage operator to simulate, for Church integers, the “call by value” in a context of a “call by name” strategy. In this pre...
The IDR method of Sonneveld and van Gijzen [SIAM J. Sci. Comput., 31:1035–1062, 2008] is shown to be a Petrov-Galerkin (projection) method with a particular choice of left Krylov...
Through analysis of present pseudo-parallel genetic algorithm, propose a new dynamic sub-population pseudo-parallel genetic algorithm. It changes the condition that the magnitude o...