- Experiments on Dense Graphs with a Stochastic, Peer-to-Peer Colorer Stephen Fitzpatrick and Lambert Meertens
- The Automated Derivation of Sparse Implementations of Numerical Algorithms through Program Transformation1
- Soft, Real-Time, Distributed Graph Coloring using Decentralized, Synchronous, Stochastic,
- Deriving distributed MIMD implementations from functional speci cations
- Array Form Transformations: Proofs of Correctness1 Stephen Fitzpatrick, M. Clint, P. Kilpatrick
- Asynchronous Execution and Communication Latency in Distributed Constraint Optimization
- Deriving DAP Implementations of Numerical Mathematical Software through Automated Program Transformation1
- The Specification of Array-Based Algorithms and the Automated Derivation of Parallel Implementations
- Deriving Efficient Parallel Implementations of Algorithms Operating on General Sparse Matrices using Automatic
- An Examination of Criticality-Sensitive Approaches to Coordination Pedro Szekely, Rajiv Maheswaran, Robert Neches, Craig Rogers and Romeo Sanchez
- The Distributed Construction of a Global Coordinate System in a
- Peer-to-Peer Coordination of Autonomous Sensors in High-Latency Networks using
- Unfolding Recursive Function Definitions Using the Paradoxical Combinator
- Integrated Design and Process Technology, IDPT-2002 Printed in the United States of America, June, 2002
- CSC: Criticality-Sensitive Coordination Pedro Szekely
- Plan Execution and Coordination Pedro Szekely
- The Construction of Numerical Mathematical Software for the AMT DAP by Program Transformation.
- The Tailoring of Abstract Functional Specifications of Numerical Algorithms for Sparse Data Structures through
- The Automated Transformation of Abstract Specifications of Numerical Algorithms into Efficient
- A Case Study on Proving Transformations Correct: Data-Parallel Conversion
- Correctness Issues in Transformational Re nement Peter Kilpatrick, M Clint, T J Harmer and S Fitzpatrick
- An Algebra for Deriving Efficient Implementations for an Array Processor Parallel Computer from
- Program Transformations for Automatically Tailoring Algorithms to Sparse Matrices1
- ffl P stores the product matrix; ffl matr and matc are the DAP functions for row and columnwise expansions;
- Soft, RealTime, Distributed Graph Coloring using Decentralized, Synchronous, Stochastic,
- Asynchronous Execution and Communication Latency in Distributed Constraint Optimization
- A Family of Intermediate Forms 1 M. Clint, Stephen Fitzpatrick, T.J. Harmer, P. Kilpatrick, J.M. Boyle y
- The Distributed Construction of a Global Coordinate System in a
- Experiments on Dense Graphs with a Stochastic, PeertoPeer Colorer Stephen Fitzpatrick and Lambert Meertens #
- Program Transformations for Automatically Tailoring Algorithms to Sparse Matrices 1
- An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for
- A Case Study on Proving Transformations Correct: DataParallel Conversion \Lambda
- PeertoPeer Coordination of Autonomous Sensors in HighLatency Networks using
- The Construction of Numerical Mathematical Software for the AMT DAP by Program Transformation.
- The Tailoring of Abstract Functional Specifications of Numerical Algorithms for Sparse Data Structures through
- Integrated Design and Process Technology, IDPT2002 Printed in the United States of America, June, 2002
- Deriving DAP Implementations of Numerical Mathematical Software through Automated Program Transformation 1
- The Automated Derivation of Sparse Implementations of Numerical Algorithms through Program Transformation 1
- Deriving distributed MIMD implementations from functional specifications
- A Family of Data-Parallel Derivations ? M Clint 1 , Stephen Fitzpatrick 1 , T J Harmer 1 , P L Kilpatrick 1 and J M Boyle 2
- Correctness Issues in Transformational Refinement Peter Kilpatrick, M Clint, T J Harmer and S Fitzpatrick
- Bibliography [99] A. Wilstrom. Functional Programming using Standard ML. Prentice Hall, 1987.
- An Algebra for Deriving Efficient Implementations for an Array Processor Parallel Computer from
- Deriving Efficient Parallel Implementations of Algorithms Operating on General Sparse Matrices using Automatic
- Unfolding Recursive Function Definitions Using the Paradoxical Combinator \Lambda
- The Automated Transformation of Abstract Speci cations of Numerical Algorithms into Ecient
- An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for
- A Family of Data-Parallel Derivations , Stephen Fitzpatrick1
- A Family of Intermediate Forms1 M. Clint, Stephen Fitzpatrick, T.J. Harmer, P. Kilpatrick, J.M. Boyley