default search action
Search dblp for Publications
export results for "toc:db/journals/ai/ai243.bht:"
@article{DBLP:journals/ai/HutterLBBHL17, author = {Frank Hutter and Marius Lindauer and Adrian Balint and Sam Bayless and Holger H. Hoos and Kevin Leyton{-}Brown}, title = {The Configurable {SAT} Solver Challenge {(CSSC)}}, journal = {Artif. Intell.}, volume = {243}, pages = {1--25}, year = {2017}, url = {https://doi.org/10.1016/j.artint.2016.09.006}, doi = {10.1016/J.ARTINT.2016.09.006}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ai/HutterLBBHL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/KandasamySP17, author = {Kirthevasan Kandasamy and Jeff G. Schneider and Barnab{\'{a}}s P{\'{o}}czos}, title = {Query efficient posterior estimation in scientific experiments via Bayesian active learning}, journal = {Artif. Intell.}, volume = {243}, pages = {45--56}, year = {2017}, url = {https://doi.org/10.1016/j.artint.2016.11.002}, doi = {10.1016/J.ARTINT.2016.11.002}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/KandasamySP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/LuoCSH17, author = {Chuan Luo and Shaowei Cai and Kaile Su and Wenxuan Huang}, title = {{CCEHC:} An efficient local search algorithm for weighted partial maximum satisfiability}, journal = {Artif. Intell.}, volume = {243}, pages = {26--44}, year = {2017}, url = {https://doi.org/10.1016/j.artint.2016.11.001}, doi = {10.1016/J.ARTINT.2016.11.001}, timestamp = {Wed, 20 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ai/LuoCSH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.