Sciweavers

878 search results - page 57 / 176
» Choice and development
Sort
View
MPC
1992
Springer
135views Mathematics» more  MPC 1992»
15 years 8 months ago
A Calculus for Predicative Programming
A calculus for developing programs from specifications written as predicates that describe the relationship between the initial and final state is proposed. Such specifications are...
Emil Sekerinski
DIAGRAMS
2004
Springer
15 years 8 months ago
Towards a Default Reading for Constraint Diagrams
Constraint diagrams are a diagrammatic notation which may be used to express logical constraints. They were designed to complement the Unified Modeling Language in the development ...
Andrew Fish, John Howse
FOSSACS
2006
Springer
15 years 8 months ago
Guessing Attacks and the Computational Soundness of Static Equivalence
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
Martín Abadi, Mathieu Baudet, Bogdan Warins...
ACSC
2003
IEEE
15 years 8 months ago
Efficient Trie-Based Sorting of Large Sets of Strings
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
Ranjan Sinha, Justin Zobel
CCGRID
2001
IEEE
15 years 8 months ago
Performance Evaluation of an Agent-Based Resource Management Infrastructure for Grid Computing
Resource management is an important infrastructure in the grid computing environment. Scalability and adaptability are two key challenges in the implementation of such complex sof...
Junwei Cao, Darren J. Kerbyson, Graham R. Nudd