Results for:
"
Alan+M.+Clark
" in Documents
- Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive ...
- We describe a novel technique for the automatic synthesis of tail-recursive programs. The technique is to specify the required program using the standard equations and then synthesise the tail-recursi...
-
Rating:
Views: (1008)
Pages: ()
Uploaded: 13-05-09
- Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive ...
- We describe a novel technique for the automatic synthesis of tail-recursive programs. The technique is to specify the required program using the standard equations and then synthesise the tail-recursi...
-
Rating:
Views: (1020)
Pages: ()
Uploaded: 13-05-09
- Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive ...
- We describe a novel technique for the automatic synthesis of tail-recursive programs. The technique is to specify the required program using the standard equations and then synthesise the tail-recursi...
-
Rating:
Views: (1007)
Pages: ()
Uploaded: 13-05-09
- Optimal Matrix Transposition and Bit Reversal on Hypercubes All-to-All...
- In a hypercube multiprocessor with distributed memory, messages have a street address and an apartment number, i.e., a hypercube node address and a local memory address. Here we describe an optimal al...
-
Rating:
Views: (1017)
Pages: ()
Uploaded: 13-05-09
- Optimal Matrix Transposition and Bit Reversal on Hypercubes All-to-All...
- In a hypercube multiprocessor with distributed memory, messages have a street address and an apartment number, i.e., a hypercube node address and a local memory address. Here we describe an optimal al...
-
Rating:
Views: (1007)
Pages: ()
Uploaded: 13-05-09
- Optimal Matrix Transposition and Bit Reversal on Hypercubes All-to-All...
- In a hypercube multiprocessor with distributed memory, messages have a street address and an apartment number, i.e., a hypercube node address and a local memory address. Here we describe an optimal al...
-
Rating:
Views: (1008)
Pages: ()
Uploaded: 13-05-09
- The Complexity Of The Maxi_fem Neto Flow Problem
- This thesis deals with the computational complexity of the maximum network flow problem. We first introduce the basic concepts and fundamental theorems upon which the study of "max-flow" has been buil...
-
Rating:
Views: (1004)
Pages: ()
Uploaded: 15-05-09
- source Globalization Trade and Development Some Lessons From History 2...
- This paper was prepared for the IDB-Brookings Conference on Regional Integration And Trade,
-
Rating:
Views: (1021)
Pages: ()
Uploaded: 08-04-09