With growing cost of electricity, the power management of server clusters has become an important problem. However, most previous researchers only address the challenge in homogen...
We study the Medvedev degrees of mass problems with distinguished topological properties, such as denseness, closedness, or discreteness. We investigate the sublattices generated ...
Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi
Queueing delays experienced by packets buffered at a node are among the most difficult to predict when considering the performance of a flow in a network. The arrivals of packets a...
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
Abstract Communities of autonomous units are devices for the visual modeling of interactive logistic processes. The framework is founded on rule-based graph transformation and allo...