Sciweavers

4757 search results - page 538 / 952
» Monads for Functional Programming
Sort
View
HPCN
2000
Springer
15 years 10 months ago
Dynamic Reconfiguration in Coordination Languages
A rather recent approach in programming parallel and distributed systems is that of coordination models and languages. Coordination programming enjoys a number of advantages such a...
George A. Papadopoulos, Farhad Arbab
ICALP
2000
Springer
15 years 10 months ago
An Optimal Minimum Spanning Tree Algorithm
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
Seth Pettie, Vijaya Ramachandran
ICALP
2000
Springer
15 years 10 months ago
Temporal Rewards for Performance Evaluation
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
Jeroen Voeten
IFIP
2000
Springer
15 years 10 months ago
A Product Family Approach to Graceful Degradation
Design of gracefully degrading systems, where functionality is gradually reduced in the face of faults, has traditionally been a very difficult and error-prone task. General appro...
William Nace, Phil Koopman
IFIP
2000
Springer
15 years 10 months ago
A Performance Analysis of IEEE 802.11 Networks in the Presence of Hidden Stations
: IEEE 802.11 is a wireless network standard that was completed in 1997. Unfortunately, the medium access protocol described in the standard meets some problems that arise from the...
Marek Natkaniec, Andrzej R. Pach