J. A. Harland and S. Michaylov. Implementing an ODE solver: a CLP approach. Technical Report TR 87/92, Department of Computer Science, Monash University, June 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
From Simulation to Practice: Cache Performance Study of a.. - Lopes, Castro, al. (Correct)
....system [4] learning the rules of multiplication. This is a non deterministic application with heavy database manipulation. Rkf45: a CLP(R) implementation of RKF45, the Watt and Shampine algorithm for the Runge Kutta Fehlberg ordinary di erential equation solver, with automatic error estimation [10]. 4. PERFORMANCE ANALYSIS We analyzed level 1 and level 2 cache performance for ten Prolog applications. The results show very di erent scenarios depending on application size and whether the applications are deterministic or not. We rst study each application individually. We show results with ....
J. A. Harland and S. Michaylov. Implementing an ODE solver: a CLP approach. Technical Report TR 87/92, Department of Computer Science, Monash University, June 1987.
Linear Equation Solving for Constraint Logic Programming - Jennifer Burg Peter (1995) (2 citations) (Correct)
....on a square plate with 100C on three sides and 0C on one side using a 13 13 finite element matrix. inv is a matrix inversion program which inverts a 12 12 matrix. 9 gaus tests satisfiability of a system of 100 equations in 100 variables. ode is a differential equation solver (described in [5]) running a large deterministic goal. msprimes is a magic square program where all numbers are different primes. chem is a large program determining equilibrium constants for chemical reactions. chess solves a chess puzzle from Sam Lloyd. circ solves a circuit element preference problem for a 16 ....
J.A. Harland and S. Michaylov. Implementing an ODE Solver: a CLP Approach. Technical Report 87/92. Department of Computer Science. Monash University. 1987.
CLP(R) Programmer's Manual Version 1.1 - Nevin Heintze Joxan (1992) (2 citations) Self-citation (Michaylov) (Correct)
....can serve as a suitable introductory text. Further technical information on CLP(R) is available on language design and implementation [6, 7] meta programming [3] and delay mechanisms [8] Additionally, much has been written about applications in electrical engineering [2] differential equations [1], options trading [10] music theory [15] molecular biology [16] etc. This document is both an introductory tutorial and reference manual describing the compiler based implementation of CLP(R) The reader experienced with PROLOG or CLP(R) may wish to skip to Chapter 4, and in particular, see the ....
.... 9, S = 1, M = 1, C1 = 0, C2 = 0, C3 = 0, C4 = 0, C1 = 1, C2 = 1, C3 = 1, C4 = 1, M = C1, C2 S M = O C1 10, C3 E O = N 10 C2, C4 N R = E 10 C3, D E = Y 10 C4, bit(C1) bit(C2) bit(C3) bit(C4) bit(0) bit(1) gendiffdigits(L) gendiffdigits(L, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]) gendiffdigits( gendiffdigits( H T] L) select(H, L, L2) gendiffdigits(T, L2) select(H, H T] T) select(H, H2 T] H2 T2] select(H, T, T2) solve(S, E, N, D, M, O, R, Y) Critical Path Analysis This program uses local propagation to compute start, ....
J.A. Harland and S. Michaylov, "Implementing an ODE Solver: a CLP Approach", Technical Report 87/92, Department of Computer Science, Monash University, June 1987.
CLP(R) Programmer's Manual Version 1.2 - Heintze, Jaffar, Michaylov.. (1992) (2 citations) Self-citation (Michaylov) (Correct)
....as a suitable introductory text. Further technical information on CLP(R) is available on language design and implementation [12, 13] metaprogramming [7] and delay mechanisms [14] Additionally, much has been written about applications in electrical engineering [6, 18] differential equations [5, 8], temporal reasoning [1, 2, 3] protocol testing [4] structural analysis and synthesis [15] mechanical engineering [21] user interfaces [23] model based diagnosis [24] options trading [16] music theory [9] molecular biology [22] etc. This document is both an introductory tutorial and ....
.... 9, S = 1, M = 1, C1 = 0, C2 = 0, C3 = 0, C4 = 0, C1 = 1, C2 = 1, C3 = 1, C4 = 1, M = C1, C2 S M = O C1 10, C3 E O = N 10 C2, C4 N R = E 10 C3, D E = Y 10 C4, bit(C1) bit(C2) bit(C3) bit(C4) bit(0) bit(1) gendiffdigits(L) gendiffdigits(L, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]) gendiffdigits( gendiffdigits( H T] L) select(H, L, L2) gendiffdigits(T, L2) select(H, H T] T) select(H, H2 T] H2 T2] select(H, T, T2) solve(S, E, N, D, M, O, R, Y) Critical Path Analysis CHAPTER 3. PROGRAMMING IN CLP(R) 27 This program uses ....
James A. Harland and Spiro Michaylov. Implementing an ODE solver: a CLP approach. Technical Report 87/92, Department of Computer Science, Monash University, Victoria, Australia, June 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC