Symbolic Integration

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5900

Full metadata record

DC Field	Value	Language
dc.creator	Moses, Joel	-
dc.date	2004-10-04T14:08:43Z	-
dc.date	2004-10-04T14:08:43Z	-
dc.date	1966-06-01	-
dc.date.accessioned	2013-10-09T02:41:51Z	-
dc.date.available	2013-10-09T02:41:51Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-097	-
dc.identifier	http://hdl.handle.net/1721.1/5900	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	A program has been written which is capable of integrating all but two of the problems solved by the Siagle's symbollic integration program SAINT. In contrast to SAINT, it is a purely algorithmic program and it has achieved running times two to three orders of magnitude faster than SAINT. This program and some of the basic routines which it uses are described. A heuristic for integration, called the Edge heuristic, is presented. It is claimed that this heuristic with the aid of a few algorithms is capapble of solving all the problems solved by the algorithmic program and many others as well.	-
dc.format	17 p.	-
dc.format	2538141 bytes	-
dc.format	1988487 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-097	-
dc.title	Symbolic Integration	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI