Sciweavers

1855 search results - page 60 / 371
» A coding theorem for distributed computation
Sort
View
GI
2001
Springer
15 years 7 months ago
Testing Distributed Component Based Systems Using UML/OCL
We present a pragmatic approach using formal methods to increase the quality of distributed component based systems: Based on UML class diagrams annotated with OCL constraints, co...
Achim D. Brucker, Burkhart Wolff
ICS
2005
Tsinghua U.
15 years 8 months ago
Improving the computational intensity of unstructured mesh applications
Although unstructured mesh algorithms are a popular means of solving problems across a broad range of disciplines—from texture mapping to computational fluid dynamics—they ar...
Brian S. White, Sally A. McKee, Bronis R. de Supin...
115
Voted
CSFW
2007
IEEE
15 years 9 months ago
Compositional Security for Task-PIOAs
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
113
Voted
IPPS
2003
IEEE
15 years 8 months ago
Wrapping Legacy Codes for Grid-Based Applications
This paper describes a process for the semi-automatic conversion of numerical and scientific routines written in the C programming language into Triana-based computational servic...
Yan Huang, Ian Taylor, David W. Walker, Robert Dav...
CCGRID
2001
IEEE
15 years 6 months ago
A DSM Cluster Architecture Supporting Aggressive Computation in Active Networks
Active networks allow computations to be performed innetwork at routers as messages pass through them. Active networks offer unique opportunities to optimize networkcentric applic...
Peter C. J. Graham