iBet uBet
web content aggregator. Adding the entire web to your favor.
Link to original content:
https://api.openalex.org/works/doi:10.4018/JAMC.2010070101
{"id":"https://openalex.org/W2010006882","doi":"https://doi.org/10.4018/jamc.2010070101","title":"Stochastic Learning for SAT- Encoded Graph Coloring Problems","display_name":"Stochastic Learning for SAT- Encoded Graph Coloring Problems","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2010006882","doi":"https://doi.org/10.4018/jamc.2010070101","mag":"2010006882"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.4018/jamc.2010070101","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084813055","display_name":"Noureddine Bouhmala","orcid":null},"institutions":[{"id":"https://openalex.org/I51213786","display_name":"Vestfold University College","ror":"https://ror.org/00zcy2665","country_code":"NO","type":"education","lineage":["https://openalex.org/I2801380234","https://openalex.org/I51213786"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Noureddine Bouhmala","raw_affiliation_strings":["[Vestfold University College, Norway]"],"affiliations":[{"raw_affiliation_string":"[Vestfold University College, Norway]","institution_ids":["https://openalex.org/I51213786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071922620","display_name":"Ole\u2010Christoffer Granmo","orcid":"https://orcid.org/0000-0002-7287-030X"},"institutions":[{"id":"https://openalex.org/I200650556","display_name":"University of Agder","ror":"https://ror.org/03x297z98","country_code":"NO","type":"education","lineage":["https://openalex.org/I200650556"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Ole-Christoffer Granmo","raw_affiliation_strings":["University of Agder, Norway,"],"affiliations":[{"raw_affiliation_string":"University of Agder, Norway,","institution_ids":["https://openalex.org/I200650556"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.343,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.752669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":85,"max":86},"biblio":{"volume":"1","issue":"3","first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Optimization of Staff Scheduling and Rostering","score":0.9999,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Optimization of Staff Scheduling and Rostering","score":0.9999,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Problem and Variants","score":0.9953,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Distributed Constraint Optimization Problems and Algorithms","score":0.9851,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6566314},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph Coloring","score":0.615909},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.54499084},{"id":"https://openalex.org/keywords/random-satisfiability","display_name":"Random Satisfiability","score":0.540389},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5296835},{"id":"https://openalex.org/keywords/learning-automata","display_name":"Learning automata","score":0.5208838},{"id":"https://openalex.org/keywords/optimization","display_name":"Optimization","score":0.515112},{"id":"https://openalex.org/keywords/constraint-optimization","display_name":"Constraint Optimization","score":0.504803},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.46965495}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.7651284},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6566314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.63472044},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.54499084},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5296835},{"id":"https://openalex.org/C2776807809","wikidata":"https://www.wikidata.org/wiki/Q6510160","display_name":"Learning automata","level":3,"score":0.5208838},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.51581424},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47092098},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.46965495},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.30634022},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12058154},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.11764774},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.4018/jamc.2010070101","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":56,"referenced_works":["https://openalex.org/W125178576","https://openalex.org/W133641357","https://openalex.org/W139325465","https://openalex.org/W1496083386","https://openalex.org/W1516020365","https://openalex.org/W1519526968","https://openalex.org/W1521097846","https://openalex.org/W1527430996","https://openalex.org/W1537595897","https://openalex.org/W1538558539","https://openalex.org/W1564467016","https://openalex.org/W1574451223","https://openalex.org/W1574638321","https://openalex.org/W1574977213","https://openalex.org/W1582334898","https://openalex.org/W1598793332","https://openalex.org/W1667614912","https://openalex.org/W1792365433","https://openalex.org/W1871585472","https://openalex.org/W1970686950","https://openalex.org/W1977041876","https://openalex.org/W1978526866","https://openalex.org/W1984198677","https://openalex.org/W1984853564","https://openalex.org/W1995654107","https://openalex.org/W2004617458","https://openalex.org/W2004802557","https://openalex.org/W2007033386","https://openalex.org/W2021735068","https://openalex.org/W2028324904","https://openalex.org/W2036265926","https://openalex.org/W2039568841","https://openalex.org/W2046610653","https://openalex.org/W2077877806","https://openalex.org/W2092998591","https://openalex.org/W2093938881","https://openalex.org/W2104670598","https://openalex.org/W2106440199","https://openalex.org/W2128193809","https://openalex.org/W2129358994","https://openalex.org/W2141037672","https://openalex.org/W2144739522","https://openalex.org/W2146350180","https://openalex.org/W2147148915","https://openalex.org/W2150365829","https://openalex.org/W2153638045","https://openalex.org/W2162964807","https://openalex.org/W2165372647","https://openalex.org/W2167036627","https://openalex.org/W2168000780","https://openalex.org/W2265314285","https://openalex.org/W2324827308","https://openalex.org/W2401610261","https://openalex.org/W2484003876","https://openalex.org/W3035851332","https://openalex.org/W4246598646"],"related_works":["https://openalex.org/W4390280037","https://openalex.org/W4298054421","https://openalex.org/W4291316360","https://openalex.org/W3176904788","https://openalex.org/W2793500002","https://openalex.org/W21597398","https://openalex.org/W1965626709","https://openalex.org/W1545085430","https://openalex.org/W1542397451","https://openalex.org/W1170108254"],"abstract_inverted_index":{"The":[0,28,68],"graph":[1,91],"coloring":[2,92],"problem":[3,11],"(GCP)":[4],"is":[5],"a":[6,49,86],"widely":[7],"studied":[8],"combinatorial":[9],"optimization":[10],"due":[12],"to":[13,36,80],"its":[14],"numerous":[15],"applications":[16],"in":[17],"many":[18],"areas,":[19],"including":[20],"time":[21],"tabling,":[22],"frequency":[23],"assignment,":[24],"and":[25],"register":[26],"allocation.":[27],"need":[29],"for":[30,65],"more":[31],"efficient":[32],"algorithms":[33],"has":[34],"led":[35],"the":[37,46,57,66,75,81],"development":[38],"of":[39,51,74],"several":[40],"GC":[41],"solvers.":[42],"In":[43],"this":[44],"paper,":[45],"authors":[47,69],"introduce":[48],"team":[50],"Finite":[52],"Learning":[53],"Automata,":[54],"combined":[55],"with":[56],"random":[58,82],"walk":[59,83],"algorithm,":[60],"using":[61,85],"Boolean":[62],"satisfiability":[63],"encoding":[64],"GCP.":[67],"present":[70],"an":[71],"experimental":[72],"analysis":[73],"new":[76],"algorithm\u2019s":[77],"performance":[78],"compared":[79],"technique,":[84],"benchmark":[87],"set":[88],"containing":[89],"SAT-encoding":[90],"test":[93],"sets.":[94]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2010006882","counts_by_year":[{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2024-11-26T07:57:02.165769","created_date":"2016-06-24"}
