Analog implementation of BRIN for optimization problems
Refereed conference paper presented and published in conference proceedings

CUHK Authors
Author(s) no longer affiliated with CUHK

Times Cited
Web of Science0WOS source URL (as at 30/07/2020) Click here for the latest count
Altmetrics Information

Other information
AbstractThe binary relation inference network (BRIN) shows promise in obtaining the global optimal solution in a time independent of the problem size. However, the realization of this merge is depended on the implementation platforms. In this paper, analog implementation of BRIN for two different directed graph problems is studied. As transitive closure problems can transform to a special case of shortest path problems or a special case of maximum spanning tree problems, two different forms of BRIN are discussed. Their circuits. using common analog integrated circuits are investigated. Also, the BRIN solution for critical path problems is expressed. It is implemented using the separated building block circuit and the combined building block circuit. As these circuits are different, the response time of the network will be different. However, a simple circuit does not promise to give a faster solution time for BRIN.
All Author(s) ListNg HS, Lam MP
Name of ConferenceIEEE Region 10 Technical Conference on Computers, Communications, Control and Power Engineering
Start Date of Conference28/10/2002
End Date of Conference31/10/2002
Place of ConferenceBEIJING
Country/Region of ConferenceChina
Detailed descriptioned. by Vol. 1, 28-31.
Pages637 - 640
LanguagesEnglish-United Kingdom
Keywordsanalog circuit; connectionist network; dynamic programming; optimization problem
Web of Science Subject CategoriesAutomation & Control Systems; Computer Science; Computer Science, Artificial Intelligence; Energy & Fuels; Engineering; Engineering, Electrical & Electronic

Last updated on 2020-31-07 at 00:15