default search action
Search dblp for Publications
export results for "toc:db/journals/ai/ai136.bht:"
@article{DBLP:journals/ai/BernardG02, author = {Olivier Bernard and Jean{-}Luc Gouz{\'{e}}}, title = {Global qualitative description of a class of nonlinear dynamical systems}, journal = {Artif. Intell.}, volume = {136}, number = {1}, pages = {29--59}, year = {2002}, url = {https://doi.org/10.1016/S0004-3702(01)00169-2}, doi = {10.1016/S0004-3702(01)00169-2}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/BernardG02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/BowlingV02, author = {Michael H. Bowling and Manuela M. Veloso}, title = {Multiagent learning using a variable learning rate}, journal = {Artif. Intell.}, volume = {136}, number = {2}, pages = {215--250}, year = {2002}, url = {https://doi.org/10.1016/S0004-3702(02)00121-2}, doi = {10.1016/S0004-3702(02)00121-2}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/BowlingV02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/DechterF02, author = {Rina Dechter and Daniel Frost}, title = {Backjump-based backtracking for constraint satisfaction problems}, journal = {Artif. Intell.}, volume = {136}, number = {2}, pages = {147--188}, year = {2002}, url = {https://doi.org/10.1016/S0004-3702(02)00120-0}, doi = {10.1016/S0004-3702(02)00120-0}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/DechterF02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/EngesserG02, author = {Kurt Engesser and Dov M. Gabbay}, title = {Quantum logic, Hilbert space, revision theory}, journal = {Artif. Intell.}, volume = {136}, number = {1}, pages = {61--100}, year = {2002}, url = {https://doi.org/10.1016/S0004-3702(01)00164-3}, doi = {10.1016/S0004-3702(01)00164-3}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/EngesserG02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/Guijarro-BerdinasAF02, author = {Bertha Guijarro{-}Berdi{\~{n}}as and Amparo Alonso{-}Betanzos and Oscar Fontenla{-}Romero}, title = {Intelligent analysis and pattern recognition in cardiotocographic signals using a tightly coupled hybrid system}, journal = {Artif. Intell.}, volume = {136}, number = {1}, pages = {1--27}, year = {2002}, url = {https://doi.org/10.1016/S0004-3702(01)00163-1}, doi = {10.1016/S0004-3702(01)00163-1}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ai/Guijarro-BerdinasAF02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/HoriyamaI02, author = {Takashi Horiyama and Toshihide Ibaraki}, title = {Ordered binary decision diagrams as knowledge-bases}, journal = {Artif. Intell.}, volume = {136}, number = {2}, pages = {189--213}, year = {2002}, url = {https://doi.org/10.1016/S0004-3702(02)00119-4}, doi = {10.1016/S0004-3702(02)00119-4}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/HoriyamaI02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/LiuJT02, author = {Jiming Liu and Han Jing and Yuan Yan Tang}, title = {Multi-agent oriented constraint satisfaction}, journal = {Artif. Intell.}, volume = {136}, number = {1}, pages = {101--144}, year = {2002}, url = {https://doi.org/10.1016/S0004-3702(01)00174-6}, doi = {10.1016/S0004-3702(01)00174-6}, timestamp = {Fri, 21 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/LiuJT02.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.