Cargando…
“Adaptive learning” as a mechanistic candidate for reaching optimal task-set representations flexibly
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4126561/ http://dx.doi.org/10.1186/1471-2202-15-S1-P8 |
_version_ | 1782329930929930240 |
---|---|
author | Ardid, Salva Balcarras, Matthew Womelsdorf, Thilo |
author_facet | Ardid, Salva Balcarras, Matthew Womelsdorf, Thilo |
author_sort | Ardid, Salva |
collection | PubMed |
description | |
format | Online Article Text |
id | pubmed-4126561 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2014 |
publisher | BioMed Central |
record_format | MEDLINE/PubMed |
spelling | pubmed-41265612014-08-11 “Adaptive learning” as a mechanistic candidate for reaching optimal task-set representations flexibly Ardid, Salva Balcarras, Matthew Womelsdorf, Thilo BMC Neurosci Poster Presentation BioMed Central 2014-07-21 /pmc/articles/PMC4126561/ http://dx.doi.org/10.1186/1471-2202-15-S1-P8 Text en Copyright © 2014 Ardid et al; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/4.0 This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated. |
spellingShingle | Poster Presentation Ardid, Salva Balcarras, Matthew Womelsdorf, Thilo “Adaptive learning” as a mechanistic candidate for reaching optimal task-set representations flexibly |
title | “Adaptive learning” as a mechanistic candidate for reaching optimal task-set representations flexibly |
title_full | “Adaptive learning” as a mechanistic candidate for reaching optimal task-set representations flexibly |
title_fullStr | “Adaptive learning” as a mechanistic candidate for reaching optimal task-set representations flexibly |
title_full_unstemmed | “Adaptive learning” as a mechanistic candidate for reaching optimal task-set representations flexibly |
title_short | “Adaptive learning” as a mechanistic candidate for reaching optimal task-set representations flexibly |
title_sort | “adaptive learning” as a mechanistic candidate for reaching optimal task-set representations flexibly |
topic | Poster Presentation |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4126561/ http://dx.doi.org/10.1186/1471-2202-15-S1-P8 |
work_keys_str_mv | AT ardidsalva adaptivelearningasamechanisticcandidateforreachingoptimaltasksetrepresentationsflexibly AT balcarrasmatthew adaptivelearningasamechanisticcandidateforreachingoptimaltasksetrepresentationsflexibly AT womelsdorfthilo adaptivelearningasamechanisticcandidateforreachingoptimaltasksetrepresentationsflexibly |