default search action
Douglas Aberdeen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [i2]Douglas Aberdeen, Jonathan Baxter, Robert Edwards:
92c/MFlops/s, Ultra-Large-Scale Neural-Network Training on a PIII Cluster. CoRR abs/1911.05181 (2019) - [i1]Douglas Aberdeen, Jonathan Baxter:
General Matrix-Matrix Multiplication Using SIMD features of the PIII. CoRR abs/1912.04379 (2019)
2000 – 2009
- 2009
- [j2]Olivier Buffet, Douglas Aberdeen:
The factored policy-gradient planner. Artif. Intell. 173(5-6): 722-747 (2009) - 2007
- [c15]Douglas Aberdeen, Olivier Buffet:
Concurrent Probabilistic Temporal Planning with Policy-Gradients. ICAPS 2007: 10-17 - [c14]Olivier Buffet, Douglas Aberdeen:
FF + FPG: Guiding a Policy-Gradient Planner. ICAPS 2007: 42-48 - [c13]Xinhua Zhang, Douglas Aberdeen, S. V. N. Vishwanathan:
Conditional random fields for multi-agent reinforcement learning. ICML 2007: 1143-1150 - [c12]Douglas Aberdeen, Olivier Buffet, Owen Thomas:
Policy-Gradients for PSRs and POMDPs. AISTATS 2007: 3-10 - 2006
- [c11]Silvia Richter, Douglas Aberdeen, Jin Yu:
Natural Actor-Critic for Road Traffic Optimisation. NIPS 2006: 1169-1176 - 2005
- [c10]Iain Little, Douglas Aberdeen, Sylvie Thiébaux:
Prottle: A Probabilistic Temporal Planner. AAAI 2005: 1181-1186 - [c9]Olivier Buffet, Douglas Aberdeen:
Planification robuste avec (L)RTDP. CAP 2005: 127-142 - [c8]Olivier Buffet, Douglas Aberdeen:
Robust Planning with (L)RTDP. IJCAI 2005: 1214-1219 - [c7]Douglas Aberdeen:
Policy-Gradient Methods for Planning. NIPS 2005: 9-16 - [c6]Nicol N. Schraudolph, Douglas Aberdeen, Jin Yu:
Fast Online Policy Gradient Learning with SMD Gain Vector Adaptation. NIPS 2005: 1185-1192 - 2004
- [c5]Douglas Aberdeen, Sylvie Thiébaux, Lin Zhang:
Decision-Theoretic Military Operations Planning. ICAPS 2004: 402-412 - [c4]Douglas Aberdeen:
Filtered Reinforcement Learning. ECML 2004: 27-38 - 2002
- [c3]Douglas Aberdeen, Jonathan Baxter:
Scalable Internal-State Policy-Gradient Methods for POMDPs. ICML 2002: 3-10 - 2001
- [j1]Douglas Aberdeen, Jonathan Baxter:
Emmerald: a fast matrix-matrix multiply using Intel's SSE instructions. Concurr. Comput. Pract. Exp. 13(2): 103-119 (2001) - 2000
- [c2]Douglas Aberdeen, Jonathan Baxter:
General Matrix-Matrix Multiplication Using SIMD Features of the PIII (Research Note). Euro-Par 2000: 980-983 - [c1]Douglas Aberdeen, Jonathan Baxter, Robert Edwards:
98¢/Mflops/s, Ultra-Large-Scale Neural-Network Training on a PIII Cluster. SC 2000: 44
Coauthor Index
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-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: