default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark W. Perlin
Person information
- affiliation: Carnegie Mellon University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j7]Giuseppe Lancia
, Mark Perlin:
Genotyping of Pooled Microsatellite Markers by Combinatorial Optimization Techniques. Discret. Appl. Math. 88(1-3): 291-314 (1998)- 1994
- [j6]Mark W. Perlin:
Visualizing Dynamic Artificial Intelligence Algorithms and Applications. Int. J. Artif. Intell. Tools 3(2): 289-310 (1994) - [c15]Dhiraj K. Pathak, Mark W. Perlin:
Intelligent interpretation of PCR products in 1D gels for automatic molecular diagnostics. CBMS 1994: 94-97 - [c14]Dhiraj K. Pathak, Eric P. Hoffman, Mark W. Perlin:
Intelligent DNA-Based Molecular Diagnostics Using Linked Genetic Markers. ISMB 1994: 331-339 - 1993
- [j5]Mark W. Perlin:
Factored Arc Consistency for Rete Match. Int. J. Artif. Intell. Tools 2(2): 277-306 (1993) - [c13]Mark Perlin:
Principled Animation of Artificial Intelligence Algorithms. ICTAI 1993: 78-86 - [c12]Tara Cox Matise, Mark Perlin, Aravinda Chakravarti:
MultiMap: An Expert System for Automated Genetic Linkage Mapping. ISMB 1993: 260-265 - 1992
- [j4]Mark Perlin:
Arc Consistency for Factorable Relations. Artif. Intell. 53(2-3): 329-342 (1992) - [j3]Mark W. Perlin:
Transforming Recursive Processes into Efficient Algorithms: Call-Graph Caching for Artificial Intelligence. Int. J. Artif. Intell. Tools 1(2): 137-174 (1992) - [c11]Mark Perlin, Jaime G. Carbonell, Daniel P. Miranker, Salvatore J. Stolfo, Milind Tambe:
Is Production System Match Interesting? ICTAI 1992: 2-3 - [c10]Mark Perlin:
Constraint Satifaction for Production System Match. ICTAI 1992: 28-35 - 1991
- [j2]Mark W. Perlin:
Transforming Conjunctive Match into Rete: a Call-Graph Caching Approach. Int. J. Softw. Eng. Knowl. Eng. 1(4): 373-408 (1991) - [c9]Mark Perlin:
LR Recursive Transition Networks for Earley and Tomita Parsing. ACL 1991: 98-105 - [c8]Mark W. Perlin:
Arc consistency for factorable relations. ICTAI 1991: 340-345 - [c7]Mark W. Perlin:
RETE and chart parsing from bottom-up call-graph caching. ICTAI 1991: 458-467 - [c6]Mark W. Perlin:
Incremental binding-space match: the linearized matchbox algorithm. ICTAI 1991: 468-477 - 1990
- [j1]Mark Perlin:
Topologically Traversing the RETE network. Appl. Artif. Intell. 4(3): 155-177 (1990) - [c5]Mark W. Perlin, Peter Gaertner:
A graphical constraint-based production system environment. TAI 1990: 181-188 - [c4]Mark W. Perlin:
Scaffolding the RETE network. TAI 1990: 378-385
1980 – 1989
- 1989
- [c3]Mark W. Perlin:
Constraint-based specification of production rules. TAI 1989: 332-338 - [c2]Mark W. Perlin, Jean-Marc DeBaud:
Match Box: fine-grained parallelism at the match level. TAI 1989: 428-434 - [c1]Mark Perlin:
Call-Graph Caching: Transforming Programs into Networks. IJCAI 1989: 122-128
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
