"Finding least cost proofs using high order recurrent networks."

Ashraf M. Abdelbar, Emad A. M. Andrews, Gene A. Tagliarini (2003)

> Home

Details and statistics

DOI: 10.1109/IJCNN.2003.1224015

access: closed

type: Conference or Workshop Paper

metadata version: 2025-02-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ijcnn/AbdelbarAT03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcnn/AbdelbarAT03
Ashraf M. Abdelbar, Emad A. M. Andrews, Gene A. Tagliarini:
Finding least cost proofs using high order recurrent networks. IJCNN 2003: 2803-2806

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.