{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:30:32Z","timestamp":1743057032885,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319936970"},{"type":"electronic","value":"9783319936987"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93698-7_2","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:30:25Z","timestamp":1528745425000},"page":"15-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Configuration of Robust Static Parallel Portfolios for Efficient Plan Generation"],"prefix":"10.1007","author":[{"given":"Mauro","family":"Vallati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luk\u00e1\u0161","family":"Chrpa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diane","family":"Kitchin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-24318-4_12","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"T Balyo","year":"2015","unstructured":"Balyo, T., Sanders, P., Sinz, C.: HordeSat: a massively parallel portfolio SAT solver. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 156\u2013172. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_12"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1613\/jair.5080","volume":"56","author":"I Cenamor","year":"2016","unstructured":"Cenamor, I., de la Rosa, T., Fern\u00e1ndez, F.: The ibacop planning system: instance-based configured portfolios. J. Artif. Intell. Res. 56, 657\u2013691 (2016)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Fawcett, C., Vallati, M., Hutter, F., Hoffmann, J., Hoos, H., Leyton-Brown, K.: Improved features for runtime prediction of domain-independent planners. In: Proceedings of ICAPS (2014)","DOI":"10.1609\/icaps.v24i1.13680"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1613\/jair.1183","volume":"20","author":"A Gerevini","year":"2003","unstructured":"Gerevini, A., Saetti, A., Serina, I.: Planning through stochastic local search and temporal action graphs. J. Artif. Intell. Res. (JAIR) 20, 239\u2013290 (2003)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1613\/jair.4359","volume":"50","author":"A Gerevini","year":"2014","unstructured":"Gerevini, A., Saetti, A., Vallati, M.: Planning through automatic portfolio configuration: the PbP approach. J. Artif. Intell. Res. (JAIR) 50, 639\u2013696 (2014)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"2_CR6","volume-title":"Automated Planning, Theory and Practice","author":"M Ghallab","year":"2004","unstructured":"Ghallab, M., Nau, D., Traverso, P.: Automated Planning, Theory and Practice. Morgan Kaufmann, Burlington (2004)"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1609\/aimag.v34i2.2450","volume":"34","author":"Y Hamadi","year":"2013","unstructured":"Hamadi, Y., Wintersteiger, C.: Seven challenges in parallel SAT solving. AI Mag. 34(2), 99\u2013106 (2013)","journal-title":"AI Mag."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10462-007-9049-y","volume":"26","author":"M Helmert","year":"2006","unstructured":"Helmert, M.: The fast downward planning system. J. Artif. Intell. Res. 26, 191\u2013246 (2006)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR9","unstructured":"Helmert, M., R\u00f6ger, G., Karpas, E.: Fast downward stone soup: a baseline for building planner portfolios. In: Proceedings of the PAL Workshop (2011)"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1613\/jair.1144","volume":"20","author":"J Hoffmann","year":"2003","unstructured":"Hoffmann, J.: The metric-ff planning system: translating \u201cignoring delete lists\u201d to numeric state variables. J. Artif. Intell. Res. 20, 291\u2013341 (2003)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.935","volume":"17","author":"AE Howe","year":"2002","unstructured":"Howe, A.E., Dahlman, E.: A critical assessment of benchmark comparison in planning. J. Artif. Intell. Res. (JAIR) 17, 1\u201333 (2002)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"2_CR12","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. CoRR abs\/1210.7959 (2012). http:\/\/arxiv.org\/abs\/1210.7959"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-19084-6_1","volume-title":"Learning and Intelligent Optimization","author":"M Lindauer","year":"2015","unstructured":"Lindauer, M., Hoos, H., Hutter, F.: From sequential algorithm selection to parallel portfolio selection. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 1\u201316. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19084-6_1"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.artint.2015.05.005","volume":"226","author":"S N\u00fa\u00f1ez","year":"2015","unstructured":"N\u00fa\u00f1ez, S., Borrajo, D., Linares L\u00f3pez, C.: Automatic construction of optimal static sequential portfolios for AI planning and beyond. Artif. Intell. 226, 75\u2013101 (2015)","journal-title":"Artif. Intell."},{"key":"2_CR15","unstructured":"N\u00fa\u00f1ez, S., Borrajo, D., Linares L\u00f3pez, C.: Sorting sequential portfolios in automated planning. In: Proceedings of IJCAI, pp. 1638\u20131644 (2015)"},{"key":"2_CR16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1613\/jair.2972","volume":"39","author":"S Richter","year":"2010","unstructured":"Richter, S., Westphal, M.: The lama planner: guiding cost-based anytime planning with landmarks. J. Artif. Intell. Res. 39, 127\u2013177 (2010)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Seipp, J., Braun, M., Garimort, J., Helmert, M.: Learning portfolios of automatically tuned planners. In: Proceedings of ICAPS, pp. 369\u2013372 (2012)","DOI":"10.1609\/icaps.v22i1.13538"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Seipp, J., Sievers, S., Helmert, M., Hutter, F.: Automatic configuration of sequential planning portfolios. In: Proceedings of AAAI, pp. 3364\u20133370 (2015)","DOI":"10.1609\/aaai.v29i1.9640"},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1609\/aimag.v36i3.2571","volume":"36","author":"M Vallati","year":"2015","unstructured":"Vallati, M., Chrpa, L., Grzes, M., McCluskey, T., Roberts, M., Sanner, S.: The 2014 international planning competition: progress and trends. AI Mag. 36(3), 90\u201398 (2015)","journal-title":"AI Mag."},{"issue":"4","key":"2_CR20","doi-asserted-by":"publisher","first-page":"717","DOI":"10.3233\/AIC-150671","volume":"28","author":"M Vallati","year":"2015","unstructured":"Vallati, M., Chrpa, L., Kitchin, D.: Portfolio-based planning: state of the art, common practice and open challenges. AI Commun. 28(4), 717\u2013733 (2015)","journal-title":"AI Commun."},{"key":"2_CR21","unstructured":"Vallati, M., Chrpa, L., McCluskey, T.: Description of participating planners. In: Proceedings of the 8th International Planning Competition (IPC-2014) (2014)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93698-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T04:00:52Z","timestamp":1693713652000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93698-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319936970","9783319936987"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93698-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuxi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"406","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"148","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Acceptance rate in the Main Track is 28%. Acceptance rate in the workshops is 43%. A high acceptance rate in the workshops is explained by the nature of these thematic sessions, where many experts in a particular field are personally invited by workshop organisers to participate in their sessions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}