{"id":"https://openalex.org/W2058010643","doi":"https://doi.org/10.1109/tc.1979.1675300","title":"An Efficient Simplex Coverability Algorithm in E2 with Application to Stochastic Sequential Machines","display_name":"An Efficient Simplex Coverability Algorithm in E2 with Application to Stochastic Sequential Machines","publication_year":1979,"publication_date":"1979-02-01","ids":{"openalex":"https://openalex.org/W2058010643","doi":"https://doi.org/10.1109/tc.1979.1675300","mag":"2058010643"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1979.1675300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1979.1675300","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},"type":"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/A5038552514","display_name":"Silio","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Silio","raw_affiliation_strings":["Department of Electrical Engineering, University of Maryland","Department of Electrical Engineering, University of Maryland#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Maryland","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Maryland#TAB#","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038552514"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":2.0964,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.84656845,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"C-28","issue":"2","first_page":"109","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9797999858856201,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9797999858856201,"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/T11182","display_name":"Auction Theory and Applications","score":0.9785000085830688,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9718000292778015,"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/mathematics","display_name":"Mathematics","score":0.6826487183570862},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.6640881299972534},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6265473365783691},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.5765224099159241},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47482284903526306},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.43413209915161133},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.4302843511104584},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.4282096028327942},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4132891297340393},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4056839346885681},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3750832676887512},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3587338328361511},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.35170066356658936},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.3445799946784973},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.20130106806755066}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6826487183570862},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.6640881299972534},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6265473365783691},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.5765224099159241},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47482284903526306},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.43413209915161133},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.4302843511104584},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.4282096028327942},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4132891297340393},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4056839346885681},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3750832676887512},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3587338328361511},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.35170066356658936},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.3445799946784973},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.20130106806755066},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1979.1675300","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1979.1675300","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W177913229","https://openalex.org/W1655990431","https://openalex.org/W2000358470","https://openalex.org/W2011319682","https://openalex.org/W2025299767","https://openalex.org/W2027486760","https://openalex.org/W2042091653","https://openalex.org/W2082720321","https://openalex.org/W2091462324","https://openalex.org/W2143264448"],"related_works":["https://openalex.org/W1981423455","https://openalex.org/W3105408998","https://openalex.org/W1990911204","https://openalex.org/W2069107464","https://openalex.org/W2768257653","https://openalex.org/W2557288725","https://openalex.org/W3012067785","https://openalex.org/W4243575619","https://openalex.org/W4288640859","https://openalex.org/W4234917441"],"abstract_inverted_index":{"The":[0,130],"problem":[1,131],"of":[2,6,80,95,112,124,143,146,155,177],"determining":[3],"the":[4,59,93,110,113,125,139,162,166],"existence":[5],"a":[7,11,38,50,55,62,77,100,144,152],"simplex":[8,41],"which":[9,70,86,99],"covers":[10,72],"given":[12,17,78],"convex":[13,18],"polytope":[14,19,115,126],"inside":[15],"another":[16],"in":[20,58,109,138],"two-dimensional":[21],"Euclidean":[22],"space":[23],"is":[24,34,74,132,171],"shown":[25],"to":[26,36,104,127,135,160,168],"be":[27,128,169],"efficiently":[28],"solvable,":[29],"and":[30,89,116],"an":[31],"effective":[32],"procedure":[33],"derived":[35],"find":[37],"suitable":[39],"covering":[40],"or":[42,73],"show":[43],"that":[44],"none":[45],"exists.":[46],"This":[47],"solution":[48,141],"provides":[49],"finite":[51,140,153],"algorithm":[52,159],"for":[53,61,165],"satisfying":[54],"necessary":[56,88],"condition":[57],"search":[60,101],"simplicial":[63],"(fewest":[64],"states)":[65],"stochastic":[66],"sequential":[67],"machine":[68],"(SSM)":[69],"either":[71],"covered":[75],"by":[76],"SSM":[79],"rank":[81],"three.":[82],"Theorems":[83],"are":[84],"proved":[85],"establish":[87],"sufficient":[90],"conditions":[91],"restricting":[92],"class":[94],"corresponding":[96],"simplexes":[97],"through":[98],"must":[102],"proceed":[103],"those":[105],"whose":[106,117],"vertices":[107,123],"lie":[108],"boundary":[111],"bounding":[114],"facet-supporting":[118],"flats":[119],"contain":[120],"certain":[121],"specified":[122],"covered.":[129],"then":[133],"reduced":[134],"testing":[136],"roots":[137],"tree":[142],"set":[145],"second":[147],"degree":[148],"algebraic":[149],"equations":[150,167],"against":[151],"table":[154],"linear":[156],"constraints.":[157],"An":[158],"generate":[161],"constraint":[163],"sets":[164],"solved":[170],"also":[172],"presented":[173],"along":[174],"with":[175],"examples":[176],"its":[178],"application.":[179]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}