Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/ai/ai129.bht:"
@article{DBLP:journals/ai/BonetG01, author = {Blai Bonet and Hector Geffner}, title = {Planning as heuristic search}, journal = {Artif. Intell.}, volume = {129}, number = {1-2}, pages = {5--33}, year = {2001}, url = {https://doi.org/10.1016/S0004-3702(01)00108-4}, doi = {10.1016/S0004-3702(01)00108-4}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ai/BonetG01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/HansenZ01a, author = {Eric A. Hansen and Shlomo Zilberstein}, title = {LAO\({}^{\mbox{*}}\): {A} heuristic search algorithm that finds solutions with loops}, journal = {Artif. Intell.}, volume = {129}, number = {1-2}, pages = {35--62}, year = {2001}, url = {https://doi.org/10.1016/S0004-3702(01)00106-0}, doi = {10.1016/S0004-3702(01)00106-0}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ai/HansenZ01a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/JunghannsS01, author = {Andreas Junghanns and Jonathan Schaeffer}, title = {Sokoban: Enhancing general single-agent search methods using domain knowledge}, journal = {Artif. Intell.}, volume = {129}, number = {1-2}, pages = {219--251}, year = {2001}, url = {https://doi.org/10.1016/S0004-3702(01)00109-6}, doi = {10.1016/S0004-3702(01)00109-6}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/JunghannsS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/KaskD01, author = {Kalev Kask and Rina Dechter}, title = {A general scheme for automatic generation of search heuristics from specification dependencies}, journal = {Artif. Intell.}, volume = {129}, number = {1-2}, pages = {91--131}, year = {2001}, url = {https://doi.org/10.1016/S0004-3702(01)00107-2}, doi = {10.1016/S0004-3702(01)00107-2}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/KaskD01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/Koenig01, author = {Sven Koenig}, title = {Minimax real-time heuristic search}, journal = {Artif. Intell.}, volume = {129}, number = {1-2}, pages = {165--197}, year = {2001}, url = {https://doi.org/10.1016/S0004-3702(01)00103-5}, doi = {10.1016/S0004-3702(01)00103-5}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/Koenig01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/KorfRE01, author = {Richard E. Korf and Michael Reid and Stefan Edelkamp}, title = {Time complexity of iterative-deepening-A\({}^{\mbox{*}}\)}, journal = {Artif. Intell.}, volume = {129}, number = {1-2}, pages = {199--218}, year = {2001}, url = {https://doi.org/10.1016/S0004-3702(01)00094-7}, doi = {10.1016/S0004-3702(01)00094-7}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/KorfRE01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/MeseguerT01, author = {Pedro Meseguer and Carme Torras}, title = {Exploiting symmetries within constraint satisfaction search}, journal = {Artif. Intell.}, volume = {129}, number = {1-2}, pages = {133--163}, year = {2001}, url = {https://doi.org/10.1016/S0004-3702(01)00104-7}, doi = {10.1016/S0004-3702(01)00104-7}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/MeseguerT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/Muller01, author = {Martin M{\"{u}}ller}, title = {Partial order bounding: {A} new approach to evaluation in game tree search}, journal = {Artif. Intell.}, volume = {129}, number = {1-2}, pages = {279--311}, year = {2001}, url = {https://doi.org/10.1016/S0004-3702(01)00085-6}, doi = {10.1016/S0004-3702(01)00085-6}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/Muller01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/SeoIU01, author = {Masahiro Seo and Hiroyuki Iida and Jos W. H. M. Uiterwijk}, title = {The PN\({}^{\mbox{*}}\)-search algorithm: Application to tsume-shogi}, journal = {Artif. Intell.}, volume = {129}, number = {1-2}, pages = {253--277}, year = {2001}, url = {https://doi.org/10.1016/S0004-3702(01)00084-4}, doi = {10.1016/S0004-3702(01)00084-4}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/SeoIU01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/Steinberg01, author = {Louis I. Steinberg}, title = {Searching stochastically generated multi-abstraction-level design spaces}, journal = {Artif. Intell.}, volume = {129}, number = {1-2}, pages = {63--90}, year = {2001}, url = {https://doi.org/10.1016/S0004-3702(01)00105-9}, doi = {10.1016/S0004-3702(01)00105-9}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/Steinberg01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/ZhangDK01, author = {Weixiong Zhang and Rina Dechter and Richard E. Korf}, title = {Heuristic search in artificial intelligence}, journal = {Artif. Intell.}, volume = {129}, number = {1-2}, pages = {1--4}, year = {2001}, url = {https://doi.org/10.1016/S0004-3702(01)00111-4}, doi = {10.1016/S0004-3702(01)00111-4}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/ZhangDK01.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.