{"id":"https://openalex.org/W2101678858","doi":"https://doi.org/10.1109/cdc.2004.1429330","title":"Decomposition techniques for temporal resource allocation","display_name":"Decomposition techniques for temporal resource allocation","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2101678858","doi":"https://doi.org/10.1109/cdc.2004.1429330","mag":"2101678858"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2004.1429330","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2004.1429330","pdf_url":null,"source":{"id":"https://openalex.org/S4363608267","display_name":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","raw_type":"proceedings-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/A5113149336","display_name":"Chia-Le Wu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"C.C. Wu","raw_affiliation_strings":["Alpha Technologies, Inc., Burlington, MA, USA"],"affiliations":[{"raw_affiliation_string":"Alpha Technologies, Inc., Burlington, MA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103073490","display_name":"David A. Casta\u00f1\u00f3n","orcid":"https://orcid.org/0000-0002-9635-9776"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D.A. Castanon","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Boston University, Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Boston University, Boston, MA, USA","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113149336"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4158,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.76470588,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"3798","last_page":"3803 Vol.4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12288","display_name":"Optimization and Search Problems","score":0.996399998664856,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9940000176429749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7531685829162598},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6691874861717224},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6589562892913818},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6130707263946533},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5630096197128296},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5556657314300537},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5534927845001221},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5339424014091492},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.520622730255127},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.48563137650489807},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.46385595202445984},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4449576139450073},{"id":"https://openalex.org/keywords/resource-management","display_name":"Resource management (computing)","score":0.421726256608963},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4216560125350952},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4195181429386139},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.301841139793396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20001861453056335},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1261841356754303},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11273184418678284}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7531685829162598},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6691874861717224},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6589562892913818},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6130707263946533},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5630096197128296},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5556657314300537},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5534927845001221},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5339424014091492},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.520622730255127},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.48563137650489807},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.46385595202445984},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4449576139450073},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.421726256608963},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4216560125350952},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4195181429386139},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.301841139793396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20001861453056335},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1261841356754303},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11273184418678284},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cdc.2004.1429330","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2004.1429330","pdf_url":null,"source":{"id":"https://openalex.org/S4363608267","display_name":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","raw_type":"proceedings-article"},{"id":"pmh:ADA423115","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA423115","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W146370326","https://openalex.org/W1791281083","https://openalex.org/W2014245732","https://openalex.org/W2098432798","https://openalex.org/W2165275149","https://openalex.org/W2274787783","https://openalex.org/W6606060644"],"related_works":["https://openalex.org/W4255265352","https://openalex.org/W4239477580","https://openalex.org/W4285537323","https://openalex.org/W1932159282","https://openalex.org/W2090698372","https://openalex.org/W4383890581","https://openalex.org/W2965004901","https://openalex.org/W2921905705","https://openalex.org/W4233178034","https://openalex.org/W2003293420"],"abstract_inverted_index":{"We":[0,32,41,84],"consider":[1,42,85],"the":[2,34,46,67,73,111],"problem":[3,21,35,47],"of":[4,8,27,45],"allocating":[5],"a":[6,16,24,37],"set":[7],"heterogeneous":[9],"resources":[10],"with":[11,92],"availability":[12],"constraints":[13],"to":[14,65,81],"maximize":[15],"given":[17],"value":[18],"function.":[19],"The":[20],"arises":[22],"in":[23,51],"wide":[25],"variety":[26],"military":[28],"and":[29,78,106],"industrial":[30],"situations.":[31],"formulate":[33],"as":[36],"discrete-state":[38],"decision":[39],"process.":[40],"two":[43],"instances":[44],"that":[48,98],"are":[49,76],"applicable":[50],"situations":[52],"where":[53],"persistent":[54],"coverage":[55],"over":[56],"all":[57],"stages":[58],"is":[59],"desired.":[60],"While":[61],"we":[62],"were":[63],"able":[64],"solve":[66],"first":[68],"example":[69],"using":[70,89],"dynamic":[71,93],"programming,":[72],"computational":[74],"requirements":[75],"significant":[77],"not":[79],"scalable":[80],"larger":[82],"instances.":[83],"an":[86],"approximate":[87],"technique":[88],"decomposition":[90],"combined":[91],"programming.":[94],"Our":[95],"experiments":[96],"show":[97],"this":[99],"approach":[100],"requires":[101],"very":[102],"little":[103],"computation":[104],"time":[105],"produces":[107],"near-optimal":[108],"results":[109],"for":[110],"examples":[112],"considered.":[113]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}