[{"user_id":"61189","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"19561","language":[{"iso":"eng"}],"keyword":["pc2-ressources"],"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","date_created":"2020-09-18T07:54:06Z","author":[{"full_name":"Sellmann, Meinolf","last_name":"Sellmann","first_name":"Meinolf"},{"first_name":"Kevin","last_name":"Tierney","full_name":"Tierney, Kevin"}],"date_updated":"2022-01-06T06:54:07Z","doi":"10.1007/978-3-030-53552-0_12","title":"Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030535513","9783030535520"]},"citation":{"ieee":"M. Sellmann and K. Tierney, “Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types,” in <i>Lecture Notes in Computer Science</i>, Cham, 2020.","chicago":"Sellmann, Meinolf, and Kevin Tierney. “Hyper-Parameterized Dialectic Search for Non-Linear Box-Constrained Optimization with Heterogenous Variable Types.” In <i>Lecture Notes in Computer Science</i>. Cham, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53552-0_12\">https://doi.org/10.1007/978-3-030-53552-0_12</a>.","ama":"Sellmann M, Tierney K. Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types. In: <i>Lecture Notes in Computer Science</i>. Cham; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-53552-0_12\">10.1007/978-3-030-53552-0_12</a>","apa":"Sellmann, M., &#38; Tierney, K. (2020). Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types. In <i>Lecture Notes in Computer Science</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-53552-0_12\">https://doi.org/10.1007/978-3-030-53552-0_12</a>","short":"M. Sellmann, K. Tierney, in: Lecture Notes in Computer Science, Cham, 2020.","bibtex":"@inbook{Sellmann_Tierney_2020, place={Cham}, title={Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-53552-0_12\">10.1007/978-3-030-53552-0_12</a>}, booktitle={Lecture Notes in Computer Science}, author={Sellmann, Meinolf and Tierney, Kevin}, year={2020} }","mla":"Sellmann, Meinolf, and Kevin Tierney. “Hyper-Parameterized Dialectic Search for Non-Linear Box-Constrained Optimization with Heterogenous Variable Types.” <i>Lecture Notes in Computer Science</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-53552-0_12\">10.1007/978-3-030-53552-0_12</a>."},"year":"2020","place":"Cham"},{"language":[{"iso":"eng"}],"publication":"Learning and Intelligent Optimization. LION 2020.","title":"Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach","date_created":"2020-08-17T11:44:37Z","publisher":"Springer","year":"2020","series_title":"Lecture Notes in Computer Science","user_id":"76599","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"18014","status":"public","type":"book_chapter","doi":"10.1007/978-3-030-53552-0_22","author":[{"full_name":"El Mesaoudi-Paul, Adil","last_name":"El Mesaoudi-Paul","first_name":"Adil"},{"first_name":"Dimitri","last_name":"Weiß","full_name":"Weiß, Dimitri"},{"first_name":"Viktor","last_name":"Bengs","id":"76599","full_name":"Bengs, Viktor"},{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129","first_name":"Eyke"},{"first_name":"Kevin","last_name":"Tierney","full_name":"Tierney, Kevin"}],"volume":12096,"date_updated":"2022-01-06T06:53:25Z","citation":{"apa":"El Mesaoudi-Paul, A., Weiß, D., Bengs, V., Hüllermeier, E., &#38; Tierney, K. (2020). Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach. In <i>Learning and Intelligent Optimization. LION 2020.</i> (Vol. 12096, pp. 216–232). Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-030-53552-0_22\">https://doi.org/10.1007/978-3-030-53552-0_22</a>","mla":"El Mesaoudi-Paul, Adil, et al. “Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach.” <i>Learning and Intelligent Optimization. LION 2020.</i>, vol. 12096, Springer, 2020, pp. 216–32, doi:<a href=\"https://doi.org/10.1007/978-3-030-53552-0_22\">10.1007/978-3-030-53552-0_22</a>.","short":"A. El Mesaoudi-Paul, D. Weiß, V. Bengs, E. Hüllermeier, K. Tierney, in: Learning and Intelligent Optimization. LION 2020., Springer, Cham, 2020, pp. 216–232.","bibtex":"@inbook{El Mesaoudi-Paul_Weiß_Bengs_Hüllermeier_Tierney_2020, place={Cham}, series={Lecture Notes in Computer Science}, title={Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach}, volume={12096}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-53552-0_22\">10.1007/978-3-030-53552-0_22</a>}, booktitle={Learning and Intelligent Optimization. LION 2020.}, publisher={Springer}, author={El Mesaoudi-Paul, Adil and Weiß, Dimitri and Bengs, Viktor and Hüllermeier, Eyke and Tierney, Kevin}, year={2020}, pages={216–232}, collection={Lecture Notes in Computer Science} }","ieee":"A. El Mesaoudi-Paul, D. Weiß, V. Bengs, E. Hüllermeier, and K. Tierney, “Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach,” in <i>Learning and Intelligent Optimization. LION 2020.</i>, vol. 12096, Cham: Springer, 2020, pp. 216–232.","chicago":"El Mesaoudi-Paul, Adil, Dimitri Weiß, Viktor Bengs, Eyke Hüllermeier, and Kevin Tierney. “Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach.” In <i>Learning and Intelligent Optimization. LION 2020.</i>, 12096:216–32. Lecture Notes in Computer Science. Cham: Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53552-0_22\">https://doi.org/10.1007/978-3-030-53552-0_22</a>.","ama":"El Mesaoudi-Paul A, Weiß D, Bengs V, Hüllermeier E, Tierney K. Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach. In: <i>Learning and Intelligent Optimization. LION 2020.</i> Vol 12096. Lecture Notes in Computer Science. Cham: Springer; 2020:216-232. doi:<a href=\"https://doi.org/10.1007/978-3-030-53552-0_22\">10.1007/978-3-030-53552-0_22</a>"},"page":"216 - 232","intvolume":"     12096","place":"Cham","publication_status":"published","publication_identifier":{"isbn":["9783030535513","9783030535520"],"issn":["0302-9743","1611-3349"]}}]