default search action
Search dblp for Publications
export results for "toc:db/journals/jair/jair14.bht:"
@article{DBLP:journals/jair/BasuHCN01, author = {Chumki Basu and Haym Hirsh and William W. Cohen and Craig G. Nevill{-}Manning}, title = {Technical Paper Recommendation: {A} Study in Combining Multiple Information Sources}, journal = {J. Artif. Intell. Res.}, volume = {14}, pages = {231--252}, year = {2001}, url = {https://doi.org/10.1613/jair.739}, doi = {10.1613/JAIR.739}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/BasuHCN01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/BoutilierB01, author = {Craig Boutilier and Ronen I. Brafman}, title = {Partial-Order Planning with Concurrent Interacting Actions}, journal = {J. Artif. Intell. Res.}, volume = {14}, pages = {105--136}, year = {2001}, url = {https://doi.org/10.1613/jair.740}, doi = {10.1613/JAIR.740}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/BoutilierB01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/Brafman01, author = {Ronen I. Brafman}, title = {On Reachability, Relevance, and Resolution in the Planning as Satisfiability Approach}, journal = {J. Artif. Intell. Res.}, volume = {14}, pages = {1--28}, year = {2001}, url = {https://doi.org/10.1613/jair.737}, doi = {10.1613/JAIR.737}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/Brafman01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/ChenB01, author = {Xinguang Chen and Peter van Beek}, title = {Conflict-Directed Backjumping Revisited}, journal = {J. Artif. Intell. Res.}, volume = {14}, pages = {53--81}, year = {2001}, url = {https://doi.org/10.1613/jair.788}, doi = {10.1613/JAIR.788}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/ChenB01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/DebruyneB01, author = {Romuald Debruyne and Christian Bessi{\`{e}}re}, title = {Domain Filtering Consistencies}, journal = {J. Artif. Intell. Res.}, volume = {14}, pages = {205--230}, year = {2001}, url = {https://doi.org/10.1613/jair.834}, doi = {10.1613/JAIR.834}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/DebruyneB01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/Ginsberg01, author = {Matthew L. Ginsberg}, title = {{GIB:} Imperfect Information in a Computationally Challenging Game}, journal = {J. Artif. Intell. Res.}, volume = {14}, pages = {303--358}, year = {2001}, url = {https://doi.org/10.1613/jair.820}, doi = {10.1613/JAIR.820}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/Ginsberg01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/Halpern01, author = {Joseph Y. Halpern}, title = {Conditional Plausibility Measures and Bayesian Networks}, journal = {J. Artif. Intell. Res.}, volume = {14}, pages = {359--389}, year = {2001}, url = {https://doi.org/10.1613/jair.817}, doi = {10.1613/JAIR.817}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/Halpern01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/HoffmannN01, author = {J{\"{o}}rg Hoffmann and Bernhard Nebel}, title = {The {FF} Planning System: Fast Plan Generation Through Heuristic Search}, journal = {J. Artif. Intell. Res.}, volume = {14}, pages = {253--302}, year = {2001}, url = {https://doi.org/10.1613/jair.855}, doi = {10.1613/JAIR.855}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/HoffmannN01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/KustersB01, author = {Ralf K{\"{u}}sters and Alexander Borgida}, title = {What's in an Attribute? Consequences for the Least Common Subsumer}, journal = {J. Artif. Intell. Res.}, volume = {14}, pages = {167--203}, year = {2001}, url = {https://doi.org/10.1613/jair.702}, doi = {10.1613/JAIR.702}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/KustersB01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/LusenaGM01, author = {Christopher Lusena and Judy Goldsmith and Martin Mundhenk}, title = {Nonapproximability Results for Partially Observable Markov Decision Processes}, journal = {J. Artif. Intell. Res.}, volume = {14}, pages = {83--103}, year = {2001}, url = {https://doi.org/10.1613/jair.714}, doi = {10.1613/JAIR.714}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/LusenaGM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/Straccia01, author = {Umberto Straccia}, title = {Reasoning within Fuzzy Description Logics}, journal = {J. Artif. Intell. Res.}, volume = {14}, pages = {137--166}, year = {2001}, url = {https://doi.org/10.1613/jair.813}, doi = {10.1613/JAIR.813}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/Straccia01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/ZhangZ01, author = {Nevin Lianwen Zhang and Weihong Zhang}, title = {Speeding Up the Convergence of Value Iteration in Partially Observable Markov Decision Processes}, journal = {J. Artif. Intell. Res.}, volume = {14}, pages = {29--51}, year = {2001}, url = {https://doi.org/10.1613/jair.761}, doi = {10.1613/JAIR.761}, timestamp = {Mon, 21 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jair/ZhangZ01.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.