Sciweavers

757 search results - page 103 / 152
» How to decide
Sort
View
ICNP
1998
IEEE
14 years 2 months ago
Maximizable Routing Metrics
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 ...
Mohamed G. Gouda, Marco Schneider
SPATIALCOGNITION
1998
Springer
14 years 2 months ago
Judging Spatial Relations from Memory
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...
ICLP
1997
Springer
14 years 2 months ago
Non-Failure Analysis for Logic Programs
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...
Saumya K. Debray, Pedro López-García...
SIGMETRICS
1992
ACM
145views Hardware» more  SIGMETRICS 1992»
14 years 2 months ago
Analysis of the Generalized Clock Buffer Replacement Scheme for Database Transaction Processing
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 ...
Victor F. Nicola, Asit Dan, Daniel M. Dias
ATAL
2007
Springer
14 years 2 months ago
On Choosing an Efficient Service Selection Mechanism in Dynamic Environments
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...
Murat Sensoy, Pinar Yolum