乐胖代购免代理版

{"id":"https://openalex.org/W2074555203","doi":"https://doi.org/10.1080/00207721003717289","title":"A new LP formulation of the admission control problem modelled as an MDP under average reward criterion","display_name":"A new LP formulation of the admission control problem modelled as an MDP under average reward criterion","publication_year":2010,"publication_date":"2010-10-31","ids":{"openalex":"https://openalex.org/W2074555203","doi":"https://doi.org/10.1080/00207721003717289","mag":"2074555203"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207721003717289","pdf_url":null,"source":{"id":"https://openalex.org/S129640837","display_name":"International Journal of Systems Science","issn_l":"0020-7721","issn":["0020-7721","1464-5319"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"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":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/A5088978718","display_name":"Antonio Pietrabissa","orcid":"https://orcid.org/0000-0003-0188-3346"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"funder","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Antonio Pietrabissa","raw_affiliation_strings":["Department of Computer and Systems Science, University of Rome 'Sapienza', 00185, Rome, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Systems Science, University of Rome 'Sapienza', 00185, Rome, Italy#TAB#","institution_ids":["https://openalex.org/I861853513"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088978718"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":64},"biblio":{"volume":"42","issue":"12","first_page":"2085","last_page":"2096"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9977,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9977,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9917,"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"}},{"id":"https://openalex.org/T11158","display_name":"Wireless Networks and Protocols","score":0.9907,"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/blocking","display_name":"Blocking (statistics)","score":0.51563966},{"id":"https://openalex.org/keywords/admission-control","display_name":"Admission control","score":0.4594437}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.702303},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.65699446},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6561954},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.64246446},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.526959},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.52272993},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.51985914},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.51563966},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.49571908},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.49505296},{"id":"https://openalex.org/C2778234956","wikidata":"https://www.wikidata.org/wiki/Q4683813","display_name":"Admission control","level":3,"score":0.4594437},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.45759258},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4041225},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.097448915},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08387819},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08344808},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207721003717289","pdf_url":null,"source":{"id":"https://openalex.org/S129640837","display_name":"International Journal of Systems Science","issn_l":"0020-7721","issn":["0020-7721","1464-5319"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, justice, and strong institutions","score":0.75}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":35,"referenced_works":["https://openalex.org/W12255453","https://openalex.org/W1491031532","https://openalex.org/W1512866443","https://openalex.org/W1513145215","https://openalex.org/W1522095564","https://openalex.org/W1545148916","https://openalex.org/W1946216492","https://openalex.org/W1965394930","https://openalex.org/W1965881613","https://openalex.org/W2008772536","https://openalex.org/W2026805420","https://openalex.org/W2044922360","https://openalex.org/W2069255518","https://openalex.org/W2078998197","https://openalex.org/W2107498198","https://openalex.org/W2108353779","https://openalex.org/W2109285061","https://openalex.org/W2110664044","https://openalex.org/W2112070322","https://openalex.org/W2113160106","https://openalex.org/W2114537429","https://openalex.org/W2118082742","https://openalex.org/W2124224253","https://openalex.org/W2128997093","https://openalex.org/W2133691852","https://openalex.org/W2134449649","https://openalex.org/W2143929688","https://openalex.org/W2146465218","https://openalex.org/W2146644360","https://openalex.org/W2150386199","https://openalex.org/W2156568423","https://openalex.org/W2334782222","https://openalex.org/W3139944676","https://openalex.org/W4236752279","https://openalex.org/W4255738889"],"related_works":["https://openalex.org/W4255368532","https://openalex.org/W4248118543","https://openalex.org/W2392835431","https://openalex.org/W2162595738","https://openalex.org/W2162286586","https://openalex.org/W2154150516","https://openalex.org/W2146622427","https://openalex.org/W2126932387","https://openalex.org/W1965371215","https://openalex.org/W187740018"],"abstract_inverted_index":{"The":[0,26],"admission":[1],"control":[2,54],"problem":[3,101],"can":[4,49],"be":[5,50],"modelled":[6],"as":[7,20,58,73],"a":[8,21,83],"Markov":[9],"decision":[10],"process":[11],"(MDP)":[12],"under":[13],"the":[14,32,63,66,74,100,107,123,126],"average":[15],"cost":[16],"criterion":[17],"and":[18,34,118],"formulated":[19],"linear":[22],"programming":[23],"(LP)":[24],"problem.":[25],"LP":[27,67,85,109],"formulation":[28,68,110],"is":[29,96,111],"attractive":[30],"in":[31],"present":[33],"future":[35],"communication":[36],"networks,":[37],"which":[38],"support":[39],"an":[40],"increasing":[41],"number":[42,75],"of":[43,45,77,125],"classes":[44,78],"service,":[46],"since":[47],"it":[48,90],"used":[51],"to":[52,106],"explicitly":[53],"class-level":[55],"requirements,":[56],"such":[57],"class":[59],"blocking":[60],"probabilities.":[61],"On":[62],"other":[64],"hand,":[65],"suffers":[69],"from":[70],"scalability":[71],"problems":[72],"C":[76,115],"increases.":[79],"This":[80],"article":[81],"proposes":[82],"new":[84],"formulation,":[86],"which,":[87],"even":[88],"if":[89],"does":[91],"not":[92],"introduce":[93],"any":[94],"approximation,":[95],"much":[97],"more":[98],"scalable:":[99],"size":[102],"reduction":[103],"with":[104],"respect":[105],"standard":[108],"O((C":[112],"+":[113],"1)2/2":[114],").":[116],"Theoretical":[117],"numerical":[119],"simulation":[120],"results":[121],"prove":[122],"effectiveness":[124],"proposed":[127],"approach.":[128]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2074555203","counts_by_year":[],"updated_date":"2025-02-03T09:18:51.605573","created_date":"2016-06-24"}