Results 11 to 20 of about 3,142,121 (258)

Many Task Learning With Task Routing [PDF]

open access: yes2019 IEEE/CVF International Conference on Computer Vision (ICCV), 2019
Typical multi-task learning (MTL) methods rely on architectural adjustments and a large trainable parameter set to jointly optimize over several tasks. However, when the number of tasks increases so do the complexity of the architectural adjustments and resource requirements. In this paper, we introduce a method which applies a conditional feature-wise
Gjorgji Strezoski   +2 more
openaire   +5 more sources

Multiagent Task Coordination as Task Allocation Plus Task Responsibility [PDF]

open access: yes, 2020
In this work, we present a dynamic Task Coordination framework () for multiagent systems. Here task coordination refers to a twofold problem where an exogenously imposed state of affairs should be satisfied by a multiagent system. To address this problem the involved agents or agent groups need to be assigned tasks to fulfill (task allocation) and the ...
Vahid Yazdanpanah   +5 more
openaire   +2 more sources

Task inhibition and task repetition in task switching [PDF]

open access: yesEuropean Journal of Cognitive Psychology, 2006
In task-switching experiments with three tasks, the relative cost of an N–2 task repetition (task sequence ABA) compared to a task switch (task sequence CBA) is referred to as N–2 repetition cost. N–2 repetition cost is assumed to reflect persisting inhibition of a task that was recently switched away from.
Philipp, A., Koch, I.
openaire   +2 more sources

Multi-Task Retrieval for Knowledge-Intensive Tasks [PDF]

open access: yesProceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), 2021
Retrieving relevant contexts from a large corpus is a crucial step for tasks such as open-domain question answering and fact checking. Although neural retrieval outperforms traditional methods like tf-idf and BM25, its performance degrades considerably when applied to out-of-domain data. Driven by the question of whether a neural retrieval model can be
Jean Maillard   +6 more
openaire   +3 more sources

Attentive Single-Tasking of Multiple Tasks [PDF]

open access: yes2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2019
CVPR 2019 Camera ...
Kevis-Kokitsi Maninis   +2 more
openaire   +3 more sources

Task Superscalar: An Out-of-Order Task Pipeline [PDF]

open access: yes2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture, 2010
Peer ...
Yoav Etsion   +7 more
openaire   +2 more sources

Task Compass: Scaling Multi-task Pre-training with Task Prefix

open access: yesFindings of the Association for Computational Linguistics: EMNLP 2022, 2022
Findings of EMNLP ...
Zhuosheng Zhang 0001   +8 more
openaire   +2 more sources

Getting a grip on tasks that coordinate tasks

open access: yesProceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications, 2011
Workflow management systems (WFMS) are software systems that coordinate the tasks human workers and computers have to perform to achieve a certain goal. The tasks to do and their interdependencies are described in a Workflow Description Language (WDL).
Plasmeijer, R.   +3 more
openaire   +3 more sources

Auxiliary Tasks in Multi-task Learning

open access: yesCoRR, 2018
fixed minor typesetting ...
Lukas Liebel, Marco Körner 0001
openaire   +3 more sources

Private speech on an executive task: relations with task difficulty and task performance [PDF]

open access: yesCognitive Development, 2005
Measures of private speech and task performance were obtained for a sample of 46 5- and 6-year-olds engaged on a mechanical version of the Tower of London (ToL) task. Two different sets of four puzzles of increasing difficulty were attempted on two occasions. In line with Vygotskian predictions, there was a quadratic relation between private speech and
Fernyhough, C., Fradley, E.
openaire   +3 more sources

Home - About - Disclaimer - Privacy