Rete algorithm

Efficient pattern matching algorithm for implementing production rule systems

The Rete algorithm ( REE-tee, RAY-tee, rarely REET, reh-TAY) is a pattern matching algorithm for implementing rule-based systems. The algorithm was developed to efficiently apply many rules or patterns to many objects, or facts, in a knowledge base.

Nº Q2002217 ★

Comum · Saberes

Rete algorithm

Efficient pattern matching algorithm for implementing production rule systems

Texto em inglês

The Rete algorithm ( REE-tee, RAY-tee, rarely REET, reh-TAY) is a pattern matching algorithm for implementing rule-based systems. The algorithm was developed to efficiently apply many rules or patterns to many objects, or facts, in a knowledge base.

Último preço

—

Preço mínimo

—

Mediana 7 d

—

Vendas 30 d

0

Faixa 30 d

—

Em circulação

0

Cotação

Ver tabela
Datamediana MínMáxvendas

Histórico de vendas

Última venda
—
Média 30 d
—
Mínima 30 d
—
Máxima 30 d
—
Vendas 7 d
0
Vendas 30 d
0

Ainda sem vendas.

Vendas anônimas: sem comprador nem vendedor. Os números contam só vendas entre jogadores.

Na Wikipédia

Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.

The Rete algorithm ( REE-tee, RAY-tee, rarely REET, reh-TAY) is a pattern matching algorithm for implementing rule-based systems. The algorithm was developed to efficiently apply many rules or patterns to many objects, or facts, in a knowledge base. It is used to determine which of the system's rules should fire based on its data store, its facts. The Rete algorithm was designed by Charles L. Forgy of Carnegie Mellon University, first published in a working paper in 1974, and later elaborated in his 1979 Ph.D. thesis and a 1982 paper.

Texto: Wikipédia em inglês, CC BY-SA 4.0. · Imagem: Razorbliss (CC0) ·

Cartas próximas

Ver a ficha

Confirmação