default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jair/jair10.bht:"
download as .bib file
@article{DBLP:journals/jair/BarberL99,
author = {David Barber and
Pi{\"{e}}rre van de Laar},
title = {Variational Cumulant Expansions for Intractable Distributions},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {435--455},
year = {1999},
url = {https://doi.org/10.1613/jair.567},
doi = {10.1613/JAIR.567},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/BarberL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/BirnbaumL99,
author = {Elazar Birnbaum and
Eliezer L. Lozinskii},
title = {The Good Old Davis-Putnam Procedure Helps Counting Models},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {457--477},
year = {1999},
url = {https://doi.org/10.1613/jair.601},
doi = {10.1613/JAIR.601},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/BirnbaumL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/Borgida99,
author = {Alexander Borgida},
title = {Extensible Knowledge Representation: the Case of Description Reasoners},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {399--434},
year = {1999},
url = {https://doi.org/10.1613/jair.584},
doi = {10.1613/JAIR.584},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/Borgida99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/ChienSM99,
author = {Steve A. Chien and
Andre Stechert and
Darren Mutz},
title = {Efficient Heuristic Hypothesis Ranking},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {375--397},
year = {1999},
url = {https://doi.org/10.1613/jair.615},
doi = {10.1613/JAIR.615},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/ChienSM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/CohenSS99,
author = {William W. Cohen and
Robert E. Schapire and
Yoram Singer},
title = {Learning to Order Things},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {243--270},
year = {1999},
url = {https://doi.org/10.1613/jair.587},
doi = {10.1613/JAIR.587},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/CohenSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/Davis99,
author = {Ernest Davis},
title = {Order of Magnitude Comparisons of Distance},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {1--38},
year = {1999},
url = {https://doi.org/10.1613/jair.520},
doi = {10.1613/JAIR.520},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/Davis99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/FriedmanH99,
author = {Nir Friedman and
Joseph Y. Halpern},
title = {Modeling Belief in Dynamic Systems, Part {II:} Revision and Update},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {117--167},
year = {1999},
url = {https://doi.org/10.1613/jair.506},
doi = {10.1613/JAIR.506},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/FriedmanH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/FuchsF99,
author = {Dirk Fuchs and
Marc Fuchs},
title = {Cooperation between Top-Down and Bottom-Up Theorem Provers},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {169--198},
year = {1999},
url = {https://doi.org/10.1613/jair.573},
doi = {10.1613/JAIR.573},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/FuchsF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/Halpern99,
author = {Joseph Y. Halpern},
title = {A Counterexample to Theorems of Cox and Fine},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {67--85},
year = {1999},
url = {https://doi.org/10.1613/jair.536},
doi = {10.1613/JAIR.536},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/Halpern99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/Hogg99,
author = {Tad Hogg},
title = {Solving Highly Constrained Search Problems with Quantum Computers},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {39--66},
year = {1999},
url = {https://doi.org/10.1613/jair.574},
doi = {10.1613/JAIR.574},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/Hogg99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/JaakkolaJ99,
author = {Tommi S. Jaakkola and
Michael I. Jordan},
title = {Variational Probabilistic Inference and the {QMR-DT} Network},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {291--322},
year = {1999},
url = {https://doi.org/10.1613/jair.583},
doi = {10.1613/JAIR.583},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/JaakkolaJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/JoslinC99,
author = {David Joslin and
David P. Clements},
title = {Squeaky Wheel Optimization},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {353--373},
year = {1999},
url = {https://doi.org/10.1613/jair.561},
doi = {10.1613/JAIR.561},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/JoslinC99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/LongF99,
author = {Derek Long and
Maria Fox},
title = {Efficient Implementation of the Plan Graph in {STAN}},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {87--115},
year = {1999},
url = {https://doi.org/10.1613/jair.570},
doi = {10.1613/JAIR.570},
timestamp = {Tue, 02 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/LongF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/Lukasiewicz99,
author = {Thomas Lukasiewicz},
title = {Probabilistic Deduction with Conditional Constraints over Basic Events},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {199--241},
year = {1999},
url = {https://doi.org/10.1613/jair.577},
doi = {10.1613/JAIR.577},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/Lukasiewicz99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/Rintanen99,
author = {Jussi Rintanen},
title = {Constructing Conditional Plans by a Theorem-Prover},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {323--352},
year = {1999},
url = {https://doi.org/10.1613/jair.591},
doi = {10.1613/JAIR.591},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/Rintanen99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/TingW99,
author = {Kai Ming Ting and
Ian H. Witten},
title = {Issues in Stacked Generalization},
journal = {J. Artif. Intell. Res.},
volume = {10},
pages = {271--289},
year = {1999},
url = {https://doi.org/10.1613/jair.594},
doi = {10.1613/JAIR.594},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/TingW99.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.
retrieved on 2025-01-06 15:02 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
