We develop a theory for deciding, for any routing metric and any network, whether the messages in this network can be routed along paths whose metric values are maximum. In order ...
Representations and processes involved in judgments of spatial relations after route learning are investigated. The main objective is to decide which relations are explicitly repre...
Rainer Rothkegel, Karl Friedrich Wender, Sabine Sc...
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
The CLOCK algorithm is a popular buffer replacement algorithm becauseof its simplicity and its ability to approximate the performance of the Least Recently Used (LRU) replacement ...
Consumers use service selection mechanisms to decide on a service provider to interact with. Although there are various service selection mechanisms, each mechanism has different s...