default search action
Search dblp for Publications
export results for "toc:db/journals/ai/ai121.bht:"
@article{DBLP:journals/ai/BeckF00a, author = {J. Christopher Beck and Mark S. Fox}, title = {Constraint-directed techniques for scheduling alternative activities}, journal = {Artif. Intell.}, volume = {121}, number = {1-2}, pages = {211--250}, year = {2000}, url = {https://doi.org/10.1016/S0004-3702(00)00035-7}, doi = {10.1016/S0004-3702(00)00035-7}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/BeckF00a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/BoutilierDG00, author = {Craig Boutilier and Richard Dearden and Mois{\'{e}}s Goldszmidt}, title = {Stochastic dynamic programming with factored representations}, journal = {Artif. Intell.}, volume = {121}, number = {1-2}, pages = {49--107}, year = {2000}, url = {https://doi.org/10.1016/S0004-3702(00)00033-3}, doi = {10.1016/S0004-3702(00)00033-3}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/BoutilierDG00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/BrafmanT00, author = {Ronen I. Brafman and Moshe Tennenholtz}, title = {A near-optimal polynomial time algorithm for learning in certain classes of stochastic games}, journal = {Artif. Intell.}, volume = {121}, number = {1-2}, pages = {31--47}, year = {2000}, url = {https://doi.org/10.1016/S0004-3702(00)00039-4}, doi = {10.1016/S0004-3702(00)00039-4}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/BrafmanT00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/GaoLV00, author = {Qiong Gao and Ming Li and Paul M. B. Vit{\'{a}}nyi}, title = {Applying {MDL} to learn best model granularity}, journal = {Artif. Intell.}, volume = {121}, number = {1-2}, pages = {1--29}, year = {2000}, url = {https://doi.org/10.1016/S0004-3702(00)00034-5}, doi = {10.1016/S0004-3702(00)00034-5}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/GaoLV00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/GiacomoLL00, author = {Giuseppe De Giacomo and Yves Lesp{\'{e}}rance and Hector J. Levesque}, title = {ConGolog, a concurrent programming language based on the situation calculus}, journal = {Artif. Intell.}, volume = {121}, number = {1-2}, pages = {109--169}, year = {2000}, url = {https://doi.org/10.1016/S0004-3702(00)00031-X}, doi = {10.1016/S0004-3702(00)00031-X}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/GiacomoLL00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/Linhares00, author = {Alexandre Linhares}, title = {A glimpse at the metaphysics of Bongard problems}, journal = {Artif. Intell.}, volume = {121}, number = {1-2}, pages = {251--270}, year = {2000}, url = {https://doi.org/10.1016/S0004-3702(00)00042-4}, doi = {10.1016/S0004-3702(00)00042-4}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/Linhares00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/MostermanB00, author = {Pieter J. Mosterman and Gautam Biswas}, title = {A comprehensive methodology for building hybrid models of physical systems}, journal = {Artif. Intell.}, volume = {121}, number = {1-2}, pages = {171--209}, year = {2000}, url = {https://doi.org/10.1016/S0004-3702(00)00032-1}, doi = {10.1016/S0004-3702(00)00032-1}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/MostermanB00.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.