Automated process for discovering optimal programs and circuits in new computing platforms

Automated process for discovering optimal programs and circuits in new computing platforms

A method for discovering optimal algorithms is provided. The method comprises defining a starting condition for a program defining a number of program targets, wherein the program targets map program user-specified inputs to expected outputs, defining a number of program objectives, and defining a n...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Thompson, Richard Joel
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Thompson, Richard Joel
description A method for discovering optimal algorithms is provided. The method comprises defining a starting condition for a program defining a number of program targets, wherein the program targets map program user-specified inputs to expected outputs, defining a number of program objectives, and defining a number of program constraints. An iterative optimization problem is then initialized to solve for the resulting program. A determination is made if defined termination conditions have been met according to the program targets and optimization objectives. Responsive to the defined termination conditions not being met an update to the program is selected by addition or subtraction of operations, the updated program is evaluated according to the program targets, the number of program objectives are evaluated, and the optimization problem is re-iterated. Responsive to the defined termination conditions being met, the program is reassembled into an instruction set.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US11960859B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US11960859B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US11960859B23</originalsourceid><addsrcrecordid>eNqNjEEKwjAQAHPxIOof1gcIVlHao4riXb14KUu6LYEkG7Ib_b4WfICnOcwwU_M8FOWASh2kzJZEoOcMnRPLL8ouDsBJXUA_-iFjEMDYgXXZFqcCLkKkN1gOqeiYJ4_6XQSZm0mPXmjx48wsL-f76bqixC1JQkuRtH3cqqrZr-tdc9xs_2k-o208Mw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Automated process for discovering optimal programs and circuits in new computing platforms</title><source>esp@cenet</source><creator>Thompson, Richard Joel</creator><creatorcontrib>Thompson, Richard Joel</creatorcontrib><description>A method for discovering optimal algorithms is provided. The method comprises defining a starting condition for a program defining a number of program targets, wherein the program targets map program user-specified inputs to expected outputs, defining a number of program objectives, and defining a number of program constraints. An iterative optimization problem is then initialized to solve for the resulting program. A determination is made if defined termination conditions have been met according to the program targets and optimization objectives. Responsive to the defined termination conditions not being met an update to the program is selected by addition or subtraction of operations, the updated program is evaluated according to the program targets, the number of program objectives are evaluated, and the optimization problem is re-iterated. Responsive to the defined termination conditions being met, the program is reassembled into an instruction set.</description><language>eng</language><subject>CALCULATING ; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2024</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20240416&amp;DB=EPODOC&amp;CC=US&amp;NR=11960859B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20240416&amp;DB=EPODOC&amp;CC=US&amp;NR=11960859B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Thompson, Richard Joel</creatorcontrib><title>Automated process for discovering optimal programs and circuits in new computing platforms</title><description>A method for discovering optimal algorithms is provided. The method comprises defining a starting condition for a program defining a number of program targets, wherein the program targets map program user-specified inputs to expected outputs, defining a number of program objectives, and defining a number of program constraints. An iterative optimization problem is then initialized to solve for the resulting program. A determination is made if defined termination conditions have been met according to the program targets and optimization objectives. Responsive to the defined termination conditions not being met an update to the program is selected by addition or subtraction of operations, the updated program is evaluated according to the program targets, the number of program objectives are evaluated, and the optimization problem is re-iterated. Responsive to the defined termination conditions being met, the program is reassembled into an instruction set.</description><subject>CALCULATING</subject><subject>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2024</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNjEEKwjAQAHPxIOof1gcIVlHao4riXb14KUu6LYEkG7Ib_b4WfICnOcwwU_M8FOWASh2kzJZEoOcMnRPLL8ouDsBJXUA_-iFjEMDYgXXZFqcCLkKkN1gOqeiYJ4_6XQSZm0mPXmjx48wsL-f76bqixC1JQkuRtH3cqqrZr-tdc9xs_2k-o208Mw</recordid><startdate>20240416</startdate><enddate>20240416</enddate><creator>Thompson, Richard Joel</creator><scope>EVB</scope></search><sort><creationdate>20240416</creationdate><title>Automated process for discovering optimal programs and circuits in new computing platforms</title><author>Thompson, Richard Joel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US11960859B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2024</creationdate><topic>CALCULATING</topic><topic>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Thompson, Richard Joel</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Thompson, Richard Joel</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Automated process for discovering optimal programs and circuits in new computing platforms</title><date>2024-04-16</date><risdate>2024</risdate><abstract>A method for discovering optimal algorithms is provided. The method comprises defining a starting condition for a program defining a number of program targets, wherein the program targets map program user-specified inputs to expected outputs, defining a number of program objectives, and defining a number of program constraints. An iterative optimization problem is then initialized to solve for the resulting program. A determination is made if defined termination conditions have been met according to the program targets and optimization objectives. Responsive to the defined termination conditions not being met an update to the program is selected by addition or subtraction of operations, the updated program is evaluated according to the program targets, the number of program objectives are evaluated, and the optimization problem is re-iterated. Responsive to the defined termination conditions being met, the program is reassembled into an instruction set.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US11960859B2
source esp@cenet
subjects CALCULATING
COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Automated process for discovering optimal programs and circuits in new computing platforms
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T08%3A20%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Thompson,%20Richard%20Joel&rft.date=2024-04-16&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS11960859B2%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true