Titlebook: VLSI for Artificial Intelligence; José G. Delgado-Frias,Will R. Moore Book 1989 Kluwer Academic Publishers 1989 CMOS.Hardware.VLSI.algorit

只看該作者 · 發(fā)表于 2025-3-21 17:16:51

書目名稱VLSI for Artificial Intelligence影響因子(影響力)

書目名稱VLSI for Artificial Intelligence影響因子(影響力)學(xué)科排名

書目名稱VLSI for Artificial Intelligence網(wǎng)絡(luò)公開度

書目名稱VLSI for Artificial Intelligence網(wǎng)絡(luò)公開度學(xué)科排名

書目名稱VLSI for Artificial Intelligence被引頻次

書目名稱VLSI for Artificial Intelligence被引頻次學(xué)科排名

書目名稱VLSI for Artificial Intelligence年度引用

書目名稱VLSI for Artificial Intelligence年度引用學(xué)科排名

書目名稱VLSI for Artificial Intelligence讀者反饋

書目名稱VLSI for Artificial Intelligence讀者反饋學(xué)科排名

只看該作者 · 發(fā)表于 2025-3-21 21:49:22

只看該作者 · 發(fā)表于 2025-3-22 01:18:07

A 32 Bit Processor for Compiled Prologted machines to improve the execution speed. Among the logic programming languages, Prolog is actually the most widely used. For this reason the realization of efficient Prolog machines represents an essential background for the development of AI techniques.

只看該作者 · 發(fā)表于 2025-3-22 04:39:04

Carmel-1: A VLSI Architecture for Flat Concurrent Prologal” tool for programming highly parallel message-based computers. FCP is the language of our multicomputer CARMEL (Computer ARchitecture for Multiprocessing Execution of Logic programs). In this paper we describe CARMEL-1, a high performance uniprocessor component of that parallel architecture.

只看該作者 · 發(fā)表于 2025-3-22 09:53:15

只看該作者 · 發(fā)表于 2025-3-22 14:07:01

A Self-Timed Circuit for a Prolog Machinell suited for implementing relational non-deterministic languages such as Prolog (Bekkers . 1984, 1986). A bi-processor Prolog-machine has been designed on the basis of this abstract memory: the main processor carries out system calls and performs the Prolog interpretation while a dedicated processo

只看該作者 · 發(fā)表于 2025-3-22 18:37:37

只看該作者 · 發(fā)表于 2025-3-23 00:09:23

只看該作者 · 發(fā)表于 2025-3-23 02:39:25

The Pattern Addressable Memory: Hardware for Associative Processinges for applicable entries via some form of pattern match. Such operations are so fundamental that they have become the basic execution mechanism in production systems and logic programming. However performing the actual pattern match over a rule database is computationally intensive. To offset this

只看該作者 · 發(fā)表于 2025-3-23 08:54:57

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-6 04:05
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved