{"id":"https://openalex.org/W2104490983","doi":null,"title":"Combining multiple heuristics online","display_name":"Combining multiple heuristics online","alternate_titles":[],"publication_year":2007,"publication_date":"2007-07-22","ids":{"openalex":"https://openalex.org/W2104490983","mag":"2104490983"},"language":"en","primary_location":{"id":"mag:2104490983","doi":null,"is_oa":false,"landing_page_url":"https://aaaipress.org/Papers/AAAI/2007/AAAI07-190.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2104490983"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"M. J. V. Streeter","orcid":"https://orcid.org/0000-0001-9086-9831","observed_orcids":["https://orcid.org/0000-0001-9086-9831"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. J. V. Streeter","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon Univ., Pittsburgh, PA"],"raw_orcid":"https://orcid.org/0000-0001-9086-9831","affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon Univ., Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062606021","display_name":"Daniel Golovin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Golovin","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon Univ., Pittsburgh, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon Univ., Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043058554","display_name":"Stephen F. Smith","orcid":"https://orcid.org/0000-0002-7053-3166","observed_orcids":["https://orcid.org/0000-0002-7053-3166"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephen F. Smith","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon Univ., Pittsburgh, PA"],"raw_orcid":"https://orcid.org/0000-0002-7053-3166","affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon Univ., Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":5.4408,"has_fulltext":false,"cited_by_count":88,"citation_normalized_percentile":{"value":0.96812749,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1197","last_page":"1203"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.46970000863075256,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.46970000863075256,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.19519999623298645,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.06019999831914902,"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/scheduling-heuristics","display_name":"heuristic scheduling","score":0.718999981880188},{"id":"https://openalex.org/keywords/black-box-learning","display_name":"black-box learning","score":0.7009999752044678},{"id":"https://openalex.org/keywords/e-learning","display_name":"online learning","score":0.527999997138977},{"id":"https://openalex.org/keywords/no-regret-algorithms","display_name":"no-regret algorithms","score":0.828000009059906},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"sample complexity","score":0.8309999704360962},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.7940000295639038},{"id":"https://openalex.org/keywords/average-case-performance","display_name":"average-case performance","score":0.6499999761581421},{"id":"https://openalex.org/keywords/randomized-heuristics","display_name":"randomized heuristics","score":0.7680000066757202},{"id":"https://openalex.org/keywords/restart-strategy","display_name":"restart strategy","score":0.33799999952316284}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8846645951271057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7500101327896118},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6441802978515625},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5730303525924683},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.5593671202659607},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5387668609619141},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49588117003440857},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.47631916403770447},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.4206925630569458},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.403300404548645},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3348332345485687},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30543142557144165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13982194662094116},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2104490983","doi":null,"is_oa":false,"landing_page_url":"https://aaaipress.org/Papers/AAAI/2007/AAAI07-190.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.91.8393","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.8393","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~matts/Research/mstreeter_aaai_2007a.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W207099696","https://openalex.org/W1482623650","https://openalex.org/W1968525591","https://openalex.org/W2064902266","https://openalex.org/W2095709533","https://openalex.org/W2134331592","https://openalex.org/W2161704742","https://openalex.org/W2914775474"],"related_works":["https://openalex.org/W1482623650","https://openalex.org/W2526976638","https://openalex.org/W7096513166","https://openalex.org/W1600974929","https://openalex.org/W7097522420","https://openalex.org/W651369039","https://openalex.org/W164048508","https://openalex.org/W7044416981","https://openalex.org/W1524200763","https://openalex.org/W2026833845"],"abstract_inverted_index":{"We":[0,72,108,121],"present":[1,73],"black-box":[2],"techniques":[3],"for":[4,79,90,103],"learning":[5,91],"how":[6,123],"to":[7,16,45,68,124,128],"interleave":[8],"the":[9,65,110,129,133,138],"execution":[10],"of":[11,29,64,112],"multiple":[12],"heuristics":[13,30,66,134],"in":[14,131],"order":[15],"improve":[17],"average-case":[18],"performance.":[19],"In":[20],"our":[21,113,126],"model,":[22],"a":[23,27,43,69,92,100,146],"user":[24,57,139],"is":[25,35],"given":[26],"set":[28],"whose":[31],"only":[32],"observable":[33],"behavior":[34],"their":[36],"running":[37,51],"time.":[38],"Each":[39],"heuristic":[40,144],"can":[41],"compute":[42],"solution":[44],"any":[46],"problem":[47],"instance,":[48],"but":[49],"its":[50],"time":[52],"varies":[53],"across":[54],"instances.":[55],"The":[56],"solves":[58],"each":[59,143],"instance":[60],"by":[61],"interleaving":[62],"runs":[63],"according":[67],"task-switching":[70,83,93,105],"schedule.":[71],"(i)":[74],"exact":[75],"and":[76,98,137],"approximation":[77],"algorithms":[78],"computing":[80],"an":[81],"optimal":[82],"schedule":[84,94],"offline,":[85],"(ii)":[86],"sample":[87],"complexity":[88],"bounds":[89],"from":[95,117],"training":[96],"data,":[97],"(iii)":[99],"no-regret":[101],"strategy":[102],"selecting":[104],"schedules":[106],"online.":[107],"demonstrate":[109],"power":[111],"results":[114,127],"using":[115],"data":[116],"recent":[118],"solver":[119],"competitions.":[120],"outline":[122],"extend":[125],"case":[130],"which":[132],"are":[135],"randomized,":[136],"may":[140],"periodically":[141],"restart":[142],"with":[145],"fresh":[147],"random":[148],"seed.":[149]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2104490983","counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":10}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
