![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Thomas L. Dean
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [c31]Thomas L. Dean, Mark A. Ruzon, Mark Segal, Jonathon Shlens, Sudheendra Vijayanarasimhan, Jay Yagnik:
Fast, Accurate Detection of 100, 000 Object Classes on a Single Machine. CVPR 2013: 1814-1821 - [i8]Milos Hauskrecht, Nicolas Meuleau, Leslie Pack Kaelbling, Thomas L. Dean, Craig Boutilier:
Hierarchical Solution of Markov Decision Processes using Macro-actions. CoRR abs/1301.7381 (2013) - [i7]Thomas L. Dean, Robert Givan, Sonia M. Leach:
Model Reduction Techniques for Computing Approximately Optimal Solutions for Markov Decision Processes. CoRR abs/1302.1533 (2013) - [i6]Michael L. Littman, Thomas L. Dean, Leslie Pack Kaelbling:
On the Complexity of Solving Markov Decision Problems. CoRR abs/1302.4971 (2013) - [i5]Thomas L. Dean, Leslie Pack Kaelbling, Jak Kirman, Ann E. Nicholson:
Deliberation Scheduling for Time-Critical Sequential Decision Making. CoRR abs/1303.1491 (2013) - [i4]Kenneth Basye, Thomas L. Dean:
Map Learning with Indistinguishable Locations. CoRR abs/1304.1492 (2013) - [i3]Thomas L. Dean, Keiji Kanazawa:
Probabilistic Causal Reasoning. CoRR abs/1304.2348 (2013) - 2012
- [c30]Thomas L. Dean, Greg Corrado, Jonathon Shlens:
Three Controversial Hypotheses Concerning Computation in the Primate Cortex. AAAI 2012: 1543-1549 - [i2]Joel Young, Thomas L. Dean:
Exploiting Locality in Searching the Web. CoRR abs/1212.2509 (2012) - 2011
- [i1]Craig Boutilier, Thomas L. Dean, Steve Hanks:
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage. CoRR abs/1105.5460 (2011)
2000 – 2009
- 2009
- [c29]Thomas L. Dean, Richard Washington, Greg Corrado:
Recursive Sparse, Spatiotemporal Coding. ISM 2009: 645-650 - 2007
- [c28]Thomas L. Dean, Glenn Carroll, Richard Washington:
On the Prospects for Building a Working Model of the Visual Cortex. AAAI 2007: 1597-1600 - 2003
- [j17]Robert Givan, Thomas L. Dean, Matthew Greig:
Equivalence notions and model minimization in Markov decision processes. Artif. Intell. 147(1-2): 163-223 (2003) - [j16]Kee-Eung Kim, Thomas L. Dean:
Solving factored MDPs using non-homogeneous partitions. Artif. Intell. 147(1-2): 225-251 (2003) - [c27]Joel Young, Thomas L. Dean:
Exploiting Locality in Searching the Web. UAI 2003: 608-615 - 2002
- [c26]Kee-Eung Kim, Thomas L. Dean:
Solving Factored MDPs with Large Action Space Using Algebraic Decision Diagrams. PRICAI 2002: 80-89 - 2001
- [c25]Kee-Eung Kim, Thomas L. Dean:
Solving Factored MDPs via Non-Homogeneous Partitioning. IJCAI 2001: 683-689 - 2000
- [j15]Robert Givan, Sonia M. Leach, Thomas L. Dean:
Bounded-parameter Markov decision processes. Artif. Intell. 122(1-2): 71-109 (2000) - [c24]Kee-Eung Kim, Thomas L. Dean, Nicolas Meuleau:
Approximate Solutions to Factored Markov Decision Processes via Greedy Search in the Space of Finite State Controllers. AIPS 2000: 323-330
1990 – 1999
- 1999
- [j14]Craig Boutilier, Thomas L. Dean, Steve Hanks:
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage. J. Artif. Intell. Res. 11: 1-94 (1999) - 1998
- [c23]Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, Leonid Peshkin, Leslie Pack Kaelbling, Thomas L. Dean, Craig Boutilier:
Solving Very Large Weakly Coupled Markov Decision Processes. AAAI/IAAI 1998: 165-172 - [c22]Thomas L. Dean, Robert Givan, Kee-Eung Kim:
Solving Stochastic Planning Problems with Large State and Action Spaces. AIPS 1998: 102-110 - [c21]Milos Hauskrecht, Nicolas Meuleau, Leslie Pack Kaelbling, Thomas L. Dean, Craig Boutilier:
Hierarchical Solution of Markov Decision Processes using Macro-actions. UAI 1998: 220-229 - 1997
- [j13]Jon Doyle, Thomas L. Dean:
Strategic Directions in Artificial Intelligence (Reprint). AI Mag. 18(1): 87-101 (1997) - [j12]Kenneth Basye, Thomas L. Dean, Jeffrey Scott Vitter
:
Coping with Uncertainty in Map Learning. Mach. Learn. 29(1): 65-88 (1997) - [c20]Thomas L. Dean, Robert Givan:
Model Minimization in Markov Decision Processes. AAAI/IAAI 1997: 106-111 - [c19]Robert Givan, Sonia M. Leach, Thomas L. Dean:
Bounded Parameter Markov Decision Processes. ECP 1997: 234-246 - [c18]Robert Givan, Thomas L. Dean:
Model Minimization, Regression, and Propositional STRIPS Planning. IJCAI 1997: 1163-1168 - [c17]Thomas L. Dean, Robert Givan, Sonia M. Leach:
Model Reduction Techniques for Computing Approximately Optimal Solutions for Markov Decision Processes. UAI 1997: 124-131 - [r1]Thomas L. Dean, Subbarao Kambhampati:
Planning and Scheduling. The Computer Science and Engineering Handbook 1997: 614-636 - 1996
- [j11]Jon Doyle
, Thomas L. Dean:
Strategic Directions in Artificial Intelligence. ACM Comput. Surv. 28(4): 653-670 (1996) - [j10]Moises Lejter, Thomas L. Dean:
A Framework for the Development of Multiagent Architectures. IEEE Expert 11(6): 47-59 (1996) - [c16]Bart Selman, Rodney A. Brooks, Thomas L. Dean, Eric Horvitz, Tom M. Mitchell, Nils J. Nilsson:
Challenge Problems for Artificial Intelligence (Panel Statements). AAAI/IAAI, Vol. 2 1996: 1340-1345 - 1995
- [b1]Thomas L. Dean, James F. Allen, Yiannis Aloimonos:
Artificial intelligence - theory and practice. Benjamin/Cummings 1995, ISBN 978-0-8053-2547-8, pp. I-XXI, 1-563 - [j9]Kenneth Basye, Thomas L. Dean, Leslie Pack Kaelbling:
Learning Dynamics: System Identification for Perceptually Challenged Agents. Artif. Intell. 72(1-2): 139-171 (1995) - [j8]Thomas L. Dean, Leslie Pack Kaelbling, Jak Kirman, Ann E. Nicholson
:
Planning under Time Constraints in Stochastic Domains. Artif. Intell. 76(1-2): 35-74 (1995) - [j7]Thomas L. Dean, Dana Angluin, Kenneth Basye, Sean P. Engelson, Leslie Pack Kaelbling, Evangelos Kokkevis, Oded Maron:
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning. Mach. Learn. 18(1): 81-108 (1995) - [c15]Michael L. Littman, Thomas L. Dean, Leslie Pack Kaelbling:
On the Complexity of Solving Markov Decision Problems. UAI 1995: 394-402 - 1994
- [j6]Mark S. Boddy, Thomas L. Dean:
Deliberation Scheduling for Problem Solving in Time-Constrained Environments. Artif. Intell. 67(2): 245-285 (1994) - 1993
- [c14]Thomas L. Dean, Leslie Pack Kaelbling, Jak Kirman, Ann E. Nicholson:
Planning With Deadlines in Stochastic Domains. AAAI 1993: 574-579 - [c13]Thomas L. Dean, Leslie Pack Kaelbling, Jak Kirman, Ann E. Nicholson:
Deliberation Scheduling for Time-Critical Sequential Decision Making. UAI 1993: 309-316 - 1992
- [j5]Kenneth Basye, Thomas L. Dean, Jak Kirman, Moises Lejter:
A Decision-Theoretic Approach to Planning, Perception, and Control. IEEE Expert 7(4): 58-65 (1992) - [c12]Thomas L. Dean, Dana Angluin, Kenneth Basye, Sean P. Engelson, Leslie Pack Kaelbling, Evangelos Kokkevis, Oded Maron:
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning. AAAI 1992: 208-214 - 1991
- [c11]Jak Kirman, Kenneth Basye, Thomas L. Dean:
Sensor abstractions for control of navigation. ICRA 1991: 2812-2817 - [e2]Thomas L. Dean, Kathleen R. McKeown:
Proceedings of the 9th National Conference on Artificial Intelligence, Anaheim, CA, USA, July 14-19, 1991, Volume 1. AAAI Press / The MIT Press 1991, ISBN 0-262-51059-6 [contents] - [e1]Thomas L. Dean, Kathleen R. McKeown:
Proceedings of the 9th National Conference on Artificial Intelligence, Anaheim, CA, USA, July 14-19, 1991, Volume 2. AAAI Press / The MIT Press 1991 [contents] - 1990
- [c10]Thomas L. Dean, Kenneth Basye, Robert Chekaluk, Seungseok Hyun, Moises Lejter, Margaret Randazza:
Coping with Uncertainty in a Control System for Navigation and Exploration. AAAI 1990: 1010-1015
1980 – 1989
- 1989
- [j4]Thomas L. Dean, Keiji Kanazawa:
Persistence and probabilistic projection. IEEE Trans. Syst. Man Cybern. 19(3): 574-585 (1989) - [c9]Kenneth Basye, Thomas L. Dean, Jeffrey Scott Vitter:
Coping With Uncertainty in Map Learning. IJCAI 1989: 663-668 - [c8]Mark S. Boddy, Thomas L. Dean:
Solving Time-Dependent Planning Problems. IJCAI 1989: 979-984 - [c7]Keiji Kanazawa, Thomas L. Dean:
A Model for Projection and Action. IJCAI 1989: 985-990 - [c6]Kenneth Basye, Thomas L. Dean:
Map Learning with Indistinguishable Locations. UAI 1989: 331-342 - 1988
- [j3]Thomas L. Dean, Mark S. Boddy:
Reasoning About Partially Ordered Events. Artif. Intell. 36(3): 375-399 (1988) - [c5]Thomas L. Dean, Mark S. Boddy:
An Analysis of Time-Dependent Planning. AAAI 1988: 49-54 - [c4]Thomas L. Dean, Keiji Kanazawa:
Probabilistic Temporal Reasoning. AAAI 1988: 524-529 - [c3]Thomas L. Dean, Keiji Kanazawa:
Probabilistic causal reasoning. UAI 1988: 27-42 - 1987
- [j2]Thomas L. Dean, Drew V. McDermott:
Temporal Data Base Management. Artif. Intell. 32(1): 1-55 (1987) - [c2]Thomas L. Dean, Mark S. Boddy:
Incremental Causal Reasoning. AAAI 1987: 196-201 - 1986
- [j1]Thomas L. Dean:
Handling shared resources in a temporal data base management system. Decis. Support Syst. 2(2): 135-143 (1986) - [c1]Thomas L. Dean:
Handling shared resources in a temporal data base management system. COCS 1986: 81-91
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint