Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6900Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Moses, Joel | - |
| dc.date | 2004-10-20T20:05:45Z | - |
| dc.date | 2004-10-20T20:05:45Z | - |
| dc.date | 1967-09-01 | - |
| dc.date.accessioned | 2013-10-09T02:47:29Z | - |
| dc.date.available | 2013-10-09T02:47:29Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AITR-226 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6900 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | SIN and SOLDIER are heuristic programs in LISP which solve symbolic integration problems. SIN (Symbolic INtegrator) solves indefinite integration problems at the difficulty approaching those in the larger integral tables. SIN contains several more methods than are used in the previous symbolic integration program SAINT, and solves most of the problems attempted by SAINT in less than one second. SOLDIER (SOLution of Ordinary Differential Equations Routine) solves first order, first degree ordinary differential equations at the level of a good college sophomore and at an average of about five seconds per problem attempted. The differences in philosophy and operation between SAINT and SIN are described, and suggestions for extending the work presented are made. | - |
| dc.format | 7767271 bytes | - |
| dc.format | 6147174 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AITR-226 | - |
| dc.title | Symbolic Integration | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.