STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS
A formal description is given of a connectionist implementation of discrete relaxation for labelled graph matching. The network is shown to converge. The desired behavior of the algorithm is formally specified; then it is proved that the result of the relaxation meets the formal goal. The network is...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Cooper, Paul R. [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|
| Erschienen: |
Oxford, UK: Blackwell Publishing Ltd ; 1992 |
|---|
| Schlagwörter: |
|---|
| Umfang: |
Online-Ressource |
|---|
| Reproduktion: |
2007 ; Blackwell Publishing Journal Backfiles 1879-2005 |
|---|---|
| Übergeordnetes Werk: |
In: Computational intelligence - Oxford [u.a.] : Wiley-Blackwell, 1985, 8(1992), 1, Seite 0 |
| Übergeordnetes Werk: |
volume:8 ; year:1992 ; number:1 ; pages:0 |
| Links: |
|---|
| DOI / URN: |
10.1111/j.1467-8640.1992.tb00336.x |
|---|
| Katalog-ID: |
NLEJ238512975 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ238512975 | ||
| 003 | DE-627 | ||
| 005 | 20210707063722.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 120417s1992 xx |||||o 00| ||und c | ||
| 024 | 7 | |a 10.1111/j.1467-8640.1992.tb00336.x |2 doi | |
| 035 | |a (DE-627)NLEJ238512975 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 100 | 1 | |a Cooper, Paul R. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS |
| 264 | 1 | |a Oxford, UK |b Blackwell Publishing Ltd |c 1992 | |
| 300 | |a Online-Ressource | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a A formal description is given of a connectionist implementation of discrete relaxation for labelled graph matching. The network is shown to converge. The desired behavior of the algorithm is formally specified; then it is proved that the result of the relaxation meets the formal goal. The network is limited by complexity considerations to the detection and propagation of unary and binary consistency constraints. The application is fast parallel indexing into a memory of object models, based on a visually derived junction/link structure description. Implementation experiments are presented, and explicit and exact space and time requirements are developed. | ||
| 533 | |d 2007 |f Blackwell Publishing Journal Backfiles 1879-2005 |7 |2007|||||||||| | ||
| 650 | 4 | |a connectionist network | |
| 773 | 0 | 8 | |i In |t Computational intelligence |d Oxford [u.a.] : Wiley-Blackwell, 1985 |g 8(1992), 1, Seite 0 |h Online-Ressource |w (DE-627)NLEJ243926685 |w (DE-600)2016539-0 |x 1467-8640 |7 nnns |
| 773 | 1 | 8 | |g volume:8 |g year:1992 |g number:1 |g pages:0 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1111/j.1467-8640.1992.tb00336.x |q text/html |x Verlag |z Deutschlandweit zugänglich |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a ZDB-1-DJB | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 8 |j 1992 |e 1 |h 0 | ||
| author_variant |
p r c pr prc |
|---|---|
| matchkey_str |
article:14678640:1992----::tutrrcgiinyoncinsrlxt |
| hierarchy_sort_str |
1992 |
| publishDate |
1992 |
| allfields |
10.1111/j.1467-8640.1992.tb00336.x doi (DE-627)NLEJ238512975 DE-627 ger DE-627 rakwb Cooper, Paul R. verfasserin aut STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS Oxford, UK Blackwell Publishing Ltd 1992 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A formal description is given of a connectionist implementation of discrete relaxation for labelled graph matching. The network is shown to converge. The desired behavior of the algorithm is formally specified; then it is proved that the result of the relaxation meets the formal goal. The network is limited by complexity considerations to the detection and propagation of unary and binary consistency constraints. The application is fast parallel indexing into a memory of object models, based on a visually derived junction/link structure description. Implementation experiments are presented, and explicit and exact space and time requirements are developed. 2007 Blackwell Publishing Journal Backfiles 1879-2005 |2007|||||||||| connectionist network In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 8(1992), 1, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:8 year:1992 number:1 pages:0 http://dx.doi.org/10.1111/j.1467-8640.1992.tb00336.x text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 8 1992 1 0 |
| spelling |
10.1111/j.1467-8640.1992.tb00336.x doi (DE-627)NLEJ238512975 DE-627 ger DE-627 rakwb Cooper, Paul R. verfasserin aut STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS Oxford, UK Blackwell Publishing Ltd 1992 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A formal description is given of a connectionist implementation of discrete relaxation for labelled graph matching. The network is shown to converge. The desired behavior of the algorithm is formally specified; then it is proved that the result of the relaxation meets the formal goal. The network is limited by complexity considerations to the detection and propagation of unary and binary consistency constraints. The application is fast parallel indexing into a memory of object models, based on a visually derived junction/link structure description. Implementation experiments are presented, and explicit and exact space and time requirements are developed. 2007 Blackwell Publishing Journal Backfiles 1879-2005 |2007|||||||||| connectionist network In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 8(1992), 1, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:8 year:1992 number:1 pages:0 http://dx.doi.org/10.1111/j.1467-8640.1992.tb00336.x text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 8 1992 1 0 |
| allfields_unstemmed |
10.1111/j.1467-8640.1992.tb00336.x doi (DE-627)NLEJ238512975 DE-627 ger DE-627 rakwb Cooper, Paul R. verfasserin aut STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS Oxford, UK Blackwell Publishing Ltd 1992 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A formal description is given of a connectionist implementation of discrete relaxation for labelled graph matching. The network is shown to converge. The desired behavior of the algorithm is formally specified; then it is proved that the result of the relaxation meets the formal goal. The network is limited by complexity considerations to the detection and propagation of unary and binary consistency constraints. The application is fast parallel indexing into a memory of object models, based on a visually derived junction/link structure description. Implementation experiments are presented, and explicit and exact space and time requirements are developed. 2007 Blackwell Publishing Journal Backfiles 1879-2005 |2007|||||||||| connectionist network In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 8(1992), 1, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:8 year:1992 number:1 pages:0 http://dx.doi.org/10.1111/j.1467-8640.1992.tb00336.x text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 8 1992 1 0 |
| allfieldsGer |
10.1111/j.1467-8640.1992.tb00336.x doi (DE-627)NLEJ238512975 DE-627 ger DE-627 rakwb Cooper, Paul R. verfasserin aut STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS Oxford, UK Blackwell Publishing Ltd 1992 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A formal description is given of a connectionist implementation of discrete relaxation for labelled graph matching. The network is shown to converge. The desired behavior of the algorithm is formally specified; then it is proved that the result of the relaxation meets the formal goal. The network is limited by complexity considerations to the detection and propagation of unary and binary consistency constraints. The application is fast parallel indexing into a memory of object models, based on a visually derived junction/link structure description. Implementation experiments are presented, and explicit and exact space and time requirements are developed. 2007 Blackwell Publishing Journal Backfiles 1879-2005 |2007|||||||||| connectionist network In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 8(1992), 1, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:8 year:1992 number:1 pages:0 http://dx.doi.org/10.1111/j.1467-8640.1992.tb00336.x text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 8 1992 1 0 |
| allfieldsSound |
10.1111/j.1467-8640.1992.tb00336.x doi (DE-627)NLEJ238512975 DE-627 ger DE-627 rakwb Cooper, Paul R. verfasserin aut STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS Oxford, UK Blackwell Publishing Ltd 1992 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A formal description is given of a connectionist implementation of discrete relaxation for labelled graph matching. The network is shown to converge. The desired behavior of the algorithm is formally specified; then it is proved that the result of the relaxation meets the formal goal. The network is limited by complexity considerations to the detection and propagation of unary and binary consistency constraints. The application is fast parallel indexing into a memory of object models, based on a visually derived junction/link structure description. Implementation experiments are presented, and explicit and exact space and time requirements are developed. 2007 Blackwell Publishing Journal Backfiles 1879-2005 |2007|||||||||| connectionist network In Computational intelligence Oxford [u.a.] : Wiley-Blackwell, 1985 8(1992), 1, Seite 0 Online-Ressource (DE-627)NLEJ243926685 (DE-600)2016539-0 1467-8640 nnns volume:8 year:1992 number:1 pages:0 http://dx.doi.org/10.1111/j.1467-8640.1992.tb00336.x text/html Verlag Deutschlandweit zugänglich Volltext GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE AR 8 1992 1 0 |
| source |
In Computational intelligence 8(1992), 1, Seite 0 volume:8 year:1992 number:1 pages:0 |
| sourceStr |
In Computational intelligence 8(1992), 1, Seite 0 volume:8 year:1992 number:1 pages:0 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
connectionist network |
| isfreeaccess_bool |
false |
| container_title |
Computational intelligence |
| authorswithroles_txt_mv |
Cooper, Paul R. @@aut@@ |
| publishDateDaySort_date |
1992-01-01T00:00:00Z |
| hierarchy_top_id |
NLEJ243926685 |
| id |
NLEJ238512975 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ238512975</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210707063722.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">120417s1992 xx |||||o 00| ||und c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1111/j.1467-8640.1992.tb00336.x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ238512975</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cooper, Paul R.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Oxford, UK</subfield><subfield code="b">Blackwell Publishing Ltd</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A formal description is given of a connectionist implementation of discrete relaxation for labelled graph matching. The network is shown to converge. The desired behavior of the algorithm is formally specified; then it is proved that the result of the relaxation meets the formal goal. The network is limited by complexity considerations to the detection and propagation of unary and binary consistency constraints. The application is fast parallel indexing into a memory of object models, based on a visually derived junction/link structure description. Implementation experiments are presented, and explicit and exact space and time requirements are developed.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="d">2007</subfield><subfield code="f">Blackwell Publishing Journal Backfiles 1879-2005</subfield><subfield code="7">|2007||||||||||</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">connectionist network</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Computational intelligence</subfield><subfield code="d">Oxford [u.a.] : Wiley-Blackwell, 1985</subfield><subfield code="g">8(1992), 1, Seite 0</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ243926685</subfield><subfield code="w">(DE-600)2016539-0</subfield><subfield code="x">1467-8640</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:1992</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1111/j.1467-8640.1992.tb00336.x</subfield><subfield code="q">text/html</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-DJB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">1992</subfield><subfield code="e">1</subfield><subfield code="h">0</subfield></datafield></record></collection>
|
| series2 |
Blackwell Publishing Journal Backfiles 1879-2005 |
| author |
Cooper, Paul R. |
| spellingShingle |
Cooper, Paul R. misc connectionist network STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS |
| authorStr |
Cooper, Paul R. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ243926685 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
NL |
| publishPlace |
Oxford, UK |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1467-8640 |
| topic_title |
STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS connectionist network |
| publisher |
Blackwell Publishing Ltd |
| publisherStr |
Blackwell Publishing Ltd |
| topic |
misc connectionist network |
| topic_unstemmed |
misc connectionist network |
| topic_browse |
misc connectionist network |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| hierarchy_parent_title |
Computational intelligence |
| hierarchy_parent_id |
NLEJ243926685 |
| hierarchy_top_title |
Computational intelligence |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ243926685 (DE-600)2016539-0 |
| title |
STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS |
| ctrlnum |
(DE-627)NLEJ238512975 |
| title_full |
STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS |
| author_sort |
Cooper, Paul R. |
| journal |
Computational intelligence |
| journalStr |
Computational intelligence |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
1992 |
| contenttype_str_mv |
zzz |
| container_start_page |
0 |
| author_browse |
Cooper, Paul R. |
| container_volume |
8 |
| physical |
Online-Ressource |
| format_se |
Elektronische Aufsätze |
| author-letter |
Cooper, Paul R. |
| doi_str_mv |
10.1111/j.1467-8640.1992.tb00336.x |
| title_sort |
structure recognition by connectionist relaxation: formal analysis |
| title_auth |
STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS |
| abstract |
A formal description is given of a connectionist implementation of discrete relaxation for labelled graph matching. The network is shown to converge. The desired behavior of the algorithm is formally specified; then it is proved that the result of the relaxation meets the formal goal. The network is limited by complexity considerations to the detection and propagation of unary and binary consistency constraints. The application is fast parallel indexing into a memory of object models, based on a visually derived junction/link structure description. Implementation experiments are presented, and explicit and exact space and time requirements are developed. |
| abstractGer |
A formal description is given of a connectionist implementation of discrete relaxation for labelled graph matching. The network is shown to converge. The desired behavior of the algorithm is formally specified; then it is proved that the result of the relaxation meets the formal goal. The network is limited by complexity considerations to the detection and propagation of unary and binary consistency constraints. The application is fast parallel indexing into a memory of object models, based on a visually derived junction/link structure description. Implementation experiments are presented, and explicit and exact space and time requirements are developed. |
| abstract_unstemmed |
A formal description is given of a connectionist implementation of discrete relaxation for labelled graph matching. The network is shown to converge. The desired behavior of the algorithm is formally specified; then it is proved that the result of the relaxation meets the formal goal. The network is limited by complexity considerations to the detection and propagation of unary and binary consistency constraints. The application is fast parallel indexing into a memory of object models, based on a visually derived junction/link structure description. Implementation experiments are presented, and explicit and exact space and time requirements are developed. |
| collection_details |
GBV_USEFLAG_U ZDB-1-DJB GBV_NL_ARTICLE |
| container_issue |
1 |
| title_short |
STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS |
| url |
http://dx.doi.org/10.1111/j.1467-8640.1992.tb00336.x |
| remote_bool |
true |
| ppnlink |
NLEJ243926685 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1111/j.1467-8640.1992.tb00336.x |
| up_date |
2024-07-06T05:19:08.308Z |
| _version_ |
1803805679480209408 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ238512975</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210707063722.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">120417s1992 xx |||||o 00| ||und c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1111/j.1467-8640.1992.tb00336.x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ238512975</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cooper, Paul R.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Oxford, UK</subfield><subfield code="b">Blackwell Publishing Ltd</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A formal description is given of a connectionist implementation of discrete relaxation for labelled graph matching. The network is shown to converge. The desired behavior of the algorithm is formally specified; then it is proved that the result of the relaxation meets the formal goal. The network is limited by complexity considerations to the detection and propagation of unary and binary consistency constraints. The application is fast parallel indexing into a memory of object models, based on a visually derived junction/link structure description. Implementation experiments are presented, and explicit and exact space and time requirements are developed.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="d">2007</subfield><subfield code="f">Blackwell Publishing Journal Backfiles 1879-2005</subfield><subfield code="7">|2007||||||||||</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">connectionist network</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Computational intelligence</subfield><subfield code="d">Oxford [u.a.] : Wiley-Blackwell, 1985</subfield><subfield code="g">8(1992), 1, Seite 0</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ243926685</subfield><subfield code="w">(DE-600)2016539-0</subfield><subfield code="x">1467-8640</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:1992</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:0</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1111/j.1467-8640.1992.tb00336.x</subfield><subfield code="q">text/html</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-DJB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">1992</subfield><subfield code="e">1</subfield><subfield code="h">0</subfield></datafield></record></collection>
|
| score |
7.400923 |