{"id":"https://openalex.org/W1998564460","doi":"https://doi.org/10.1080/00207169608804522","title":"Solving optimisation problems using neucomp-a neural network compiler","display_name":"Solving optimisation problems using neucomp-a neural network compiler","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1998564460","doi":"https://doi.org/10.1080/00207169608804522","mag":"1998564460"},"language":"en","primary_location":{"id":"doi:10.1080/00207169608804522","is_oa":true,"landing_page_url":"https://doi.org/10.1080/00207169608804522","pdf_url":"https://www.tandfonline.com/doi/abs/10.1080/00207169608804522","source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.tandfonline.com/doi/abs/10.1080/00207169608804522","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5098089522","display_name":"D. J. Evansi","orcid":null},"institutions":[{"id":"https://openalex.org/I143804889","display_name":"Loughborough University","ror":"https://ror.org/04vg4w365","country_code":"GB","type":"education","lineage":["https://openalex.org/I143804889"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"D. J. Evansi","raw_affiliation_strings":["Parallel Algorithms Research Centre , Loughborough University of Technology , Leicestershire, LE11 3TU, U.K"],"affiliations":[{"raw_affiliation_string":"Parallel Algorithms Research Centre , Loughborough University of Technology , Leicestershire, LE11 3TU, U.K","institution_ids":["https://openalex.org/I143804889"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103147179","display_name":"Muhammad Sulaiman","orcid":"https://orcid.org/0000-0002-4040-6211"},"institutions":[{"id":"https://openalex.org/I130343225","display_name":"Universiti Putra Malaysia","ror":"https://ror.org/02e91jd64","country_code":"MY","type":"education","lineage":["https://openalex.org/I130343225"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"M. N. Sulaiman","raw_affiliation_strings":["Department of Computer Science , Universiti Pertanian Malaysia , Serdang, Selangor, 43400 UPM, Malaysia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Universiti Pertanian Malaysia , Serdang, Selangor, 43400 UPM, Malaysia","institution_ids":["https://openalex.org/I130343225"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5098089522"],"corresponding_institution_ids":["https://openalex.org/I143804889"],"apc_list":null,"apc_paid":null,"fwci":0.5726,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.74745314,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"62","issue":"1-2","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10820","display_name":"Fuzzy Logic and Control Systems","score":0.9634000062942505,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.8818050622940063},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7757410407066345},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.6398063898086548},{"id":"https://openalex.org/keywords/sequent","display_name":"Sequent","score":0.5558145642280579},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4957016706466675},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4786283075809479},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.4338301420211792},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3427962362766266},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3202712833881378}],"concepts":[{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.8818050622940063},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7757410407066345},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.6398063898086548},{"id":"https://openalex.org/C89421646","wikidata":"https://www.wikidata.org/wiki/Q843632","display_name":"Sequent","level":2,"score":0.5558145642280579},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4957016706466675},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4786283075809479},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.4338301420211792},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3427962362766266},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3202712833881378}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/00207169608804522","is_oa":true,"landing_page_url":"https://doi.org/10.1080/00207169608804522","pdf_url":"https://www.tandfonline.com/doi/abs/10.1080/00207169608804522","source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:psasir.upm.edu.my:42380","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196260","display_name":"Universiti Putra Malaysia Institutional Repository (Universiti Putra Malaysia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130343225","host_organization_name":"Universiti Putra Malaysia","host_organization_lineage":["https://openalex.org/I130343225"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":{"id":"doi:10.1080/00207169608804522","is_oa":true,"landing_page_url":"https://doi.org/10.1080/00207169608804522","pdf_url":"https://www.tandfonline.com/doi/abs/10.1080/00207169608804522","source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1998564460.pdf","grobid_xml":"https://content.openalex.org/works/W1998564460.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W16387734","https://openalex.org/W46206056","https://openalex.org/W303187627","https://openalex.org/W566985032","https://openalex.org/W622298897","https://openalex.org/W1529666041","https://openalex.org/W1597286183","https://openalex.org/W1847806463","https://openalex.org/W1989637956","https://openalex.org/W1994805007","https://openalex.org/W2010863474","https://openalex.org/W2024060531","https://openalex.org/W2054770382","https://openalex.org/W2100648544","https://openalex.org/W2109507516","https://openalex.org/W2114101195","https://openalex.org/W2136087206","https://openalex.org/W2612526924","https://openalex.org/W2738362794","https://openalex.org/W4213319612","https://openalex.org/W4251881400"],"related_works":["https://openalex.org/W2132806979","https://openalex.org/W2127315869","https://openalex.org/W1523769955","https://openalex.org/W2245390655","https://openalex.org/W4379536100","https://openalex.org/W188282463","https://openalex.org/W2002505081","https://openalex.org/W2083681681","https://openalex.org/W2577630842","https://openalex.org/W1713081424"],"abstract_inverted_index":{"NEUCOMP":[0,37],"is":[1,52,66],"a":[2,8,12,27],"Neural":[3,18],"Network":[4,19],"Compiler":[5],"that":[6],"compiles":[7],"program":[9,33],"written":[10,34,67],"as":[11],"list":[13],"of":[14,17],"mathematical":[15],"specifications":[16],"(NN)":[20],"models":[21,43,55],"and":[22,60],"then":[23],"translates":[24],"it":[25],"into":[26],"chosen":[28],"target":[29],"program.":[30],"A":[31],"simulation":[32],"in":[35],"the":[36,57,69,79],"language":[38],"based":[39],"on":[40,68],"selected":[41],"NN":[42],"for":[44],"Optimisation":[45],"problems,":[46],"i.e.":[47,82],"Travelling":[48],"Salesman":[49],"problem":[50],"(TSP)":[51],"presented.":[53],"The":[54,64],"are":[56],"Continuous":[58],"Hopfield":[59],"Potts-Glass":[61],"single-layer":[62],"networks.":[63],"compiler":[65],"Sequent":[70],"Balance":[71],"8000":[72],"machine":[73],"at":[74],"PARC.":[75],"It":[76],"combines":[77],"with":[78],"graphical":[80,87],"package,":[81],"Mathematica,":[83],"to":[84],"portray":[85],"some":[86],"features.":[88]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}