Search dblp for Publications

export results for "toc:db/journals/ai/ai244.bht:"

 download as .bib file

@article{DBLP:journals/ai/BartlettC17,
  author       = {Mark Bartlett and
                  James Cussens},
  title        = {Integer Linear Programming for the Bayesian network structure learning
                  problem},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {258--271},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2015.03.003},
  doi          = {10.1016/J.ARTINT.2015.03.003},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ai/BartlettC17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/BergJ17,
  author       = {Jeremias Berg and
                  Matti J{\"{a}}rvisalo},
  title        = {Cost-optimal constrained correlation clustering via weighted partial
                  Maximum Satisfiability},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {110--142},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2015.07.001},
  doi          = {10.1016/J.ARTINT.2015.07.001},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ai/BergJ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/BessiereKLO17,
  author       = {Christian Bessiere and
                  Fr{\'{e}}d{\'{e}}ric Koriche and
                  Nadjib Lazaar and
                  Barry O'Sullivan},
  title        = {Constraint acquisition},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {315--342},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2015.08.001},
  doi          = {10.1016/J.ARTINT.2015.08.001},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ai/BessiereKLO17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/Costa17,
  author       = {Fabrizio Costa},
  title        = {Learning an efficient constructive sampler for graphs},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {217--238},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2016.01.006},
  doi          = {10.1016/J.ARTINT.2016.01.006},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ai/Costa17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/DaoDV17,
  author       = {Thi{-}Bich{-}Hanh Dao and
                  Khanh{-}Chuong Duong and
                  Christel Vrain},
  title        = {Constrained clustering by constraint programming},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {70--94},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2015.05.006},
  doi          = {10.1016/J.ARTINT.2015.05.006},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ai/DaoDV17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/DiligentiGS17,
  author       = {Michelangelo Diligenti and
                  Marco Gori and
                  Claudio Sacc{\`{a}}},
  title        = {Semantic-based regularization for learning and inference},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {143--165},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2015.08.011},
  doi          = {10.1016/J.ARTINT.2015.08.011},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ai/DiligentiGS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/GilpinD17,
  author       = {Sean Gilpin and
                  Ian Davidson},
  title        = {A flexible {ILP} formulation for hierarchical clustering},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {95--109},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2015.05.009},
  doi          = {10.1016/J.ARTINT.2015.05.009},
  timestamp    = {Thu, 28 Dec 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ai/GilpinD17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/GunsDNTR17,
  author       = {Tias Guns and
                  Anton Dries and
                  Siegfried Nijssen and
                  Guido Tack and
                  Luc De Raedt},
  title        = {MiningZinc: {A} declarative framework for constraint-based mining},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {6--29},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2015.09.007},
  doi          = {10.1016/J.ARTINT.2015.09.007},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ai/GunsDNTR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/JabbourSS17,
  author       = {Sa{\"{\i}}d Jabbour and
                  Lakhdar Sais and
                  Yakoub Salhi},
  title        = {Mining Top-k motifs with a SAT-based framework},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {30--47},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2015.11.003},
  doi          = {10.1016/J.ARTINT.2015.11.003},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ai/JabbourSS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/KerstingMT17,
  author       = {Kristian Kersting and
                  Martin Mladenov and
                  Pavel Tokmakov},
  title        = {Relational linear programming},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {188--216},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2015.06.009},
  doi          = {10.1016/J.ARTINT.2015.06.009},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ai/KerstingMT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/LindauerHLS17,
  author       = {Marius Lindauer and
                  Holger H. Hoos and
                  Kevin Leyton{-}Brown and
                  Torsten Schaub},
  title        = {Automatic construction of parallel portfolios via algorithm configuration},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {272--290},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2016.05.004},
  doi          = {10.1016/J.ARTINT.2016.05.004},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ai/LindauerHLS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/LombardiMB17,
  author       = {Michele Lombardi and
                  Michela Milano and
                  Andrea Bartolini},
  title        = {Empirical decision model learning},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {343--367},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2016.01.005},
  doi          = {10.1016/J.ARTINT.2016.01.005},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ai/LombardiMB17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/MisirS17,
  author       = {Mustafa Misir and
                  Mich{\`{e}}le Sebag},
  title        = {Alors: An algorithm recommender system},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {291--314},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2016.12.001},
  doi          = {10.1016/J.ARTINT.2016.12.001},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ai/MisirS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/PasseriniTG17,
  author       = {Andrea Passerini and
                  Guido Tack and
                  Tias Guns},
  title        = {Introduction to the special issue on Combining Constraint Solving
                  with Mining and Learning},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {1--5},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2017.01.002},
  doi          = {10.1016/J.ARTINT.2017.01.002},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ai/PasseriniTG17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/TesoSP17,
  author       = {Stefano Teso and
                  Roberto Sebastiani and
                  Andrea Passerini},
  title        = {Structured learning modulo theories},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {166--187},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2015.04.002},
  doi          = {10.1016/J.ARTINT.2015.04.002},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ai/TesoSP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/UgarteBCLLPRS17,
  author       = {Willy Ugarte and
                  Patrice Boizumault and
                  Bruno Cr{\'{e}}milleux and
                  Alban Lepailleur and
                  Samir Loudni and
                  Marc Plantevit and
                  Chedy Ra{\"{\i}}ssi and
                  Arnaud Soulet},
  title        = {Skypattern mining: From pattern condensed representations to dynamic
                  constraint satisfaction problems},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {48--69},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2015.04.003},
  doi          = {10.1016/J.ARTINT.2015.04.003},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ai/UgarteBCLLPRS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/VerwerZY17,
  author       = {Sicco Verwer and
                  Yingqian Zhang and
                  Qing Chuan Ye},
  title        = {Auction optimization using regression trees and linear models as integer
                  programs},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {368--395},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2015.05.004},
  doi          = {10.1016/J.ARTINT.2015.05.004},
  timestamp    = {Wed, 26 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ai/VerwerZY17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ai/YaoCD17,
  author       = {Tiansheng Yao and
                  Arthur Choi and
                  Adnan Darwiche},
  title        = {Learning Bayesian network parameters under equivalence constraints},
  journal      = {Artif. Intell.},
  volume       = {244},
  pages        = {239--257},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.artint.2015.05.007},
  doi          = {10.1016/J.ARTINT.2015.05.007},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ai/YaoCD17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.