Výsledky vyhledávání - "Shortcutting"

Time-optimal parabolic interpolation with velocity, acceleration, and minimum-switch-time constraints

Autor: Puttichai Lertkultanon, Quang-Cuong Pham

Time-optimal trajectories with bounded velocities and accelerations are known to be parabolic, i.e. piecewise constant in acceleration. An important characteristic of this class of trajectories is the distribution of the switch points – the time in

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba1ce5eb6434e3b1d825f1a7a5bf23c2
http://hdl.handle.net/10220/41881

Zobrazit plný text záznamu

Dissertation/ Thesis

The neural basis of a cognitive map

Autor: Grieves, Roderick McKinlay

It has been proposed that as animals explore their environment they build and maintain a cognitive map, an internal representation of their surroundings (Tolman, 1948). We tested this hypothesis using a task designed to assess the ability of rats to

Externí odkaz: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655482

Zobrazit plný text záznamu

Shortcutting directed and undirected networks with a degree constraint

Autor: Tan, Richard B., van Leeuwen, E.J., van Leeuwen, J., Artificial Intellligence, Sub Algemeen Artificial Intelligence, Sub Algorithms and Complexity

Publikováno v: Discrete Applied Mathematics, 220, 91. Elsevier

Shortcutting is the operation of adding edges to a network with the intent to decrease its diameter. We are interested in shortcutting networks while keeping degree increases in the network bounded, a problem first posed by Chung and Garey. Improving

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1914c0920f35b0d3a5c09d6f220aa236
https://doi.org/10.1016/j.dam.2016.12.016

Zobrazit plný text záznamu

Shortcutting directed and undirected networks with a degree constraint

Publikováno v: Technical Report Series.

Short-cutting is the operation of adding edges to a network with the intent to decrease its diameter. We are interested in short-cutting graphs while keeping degree increases bounded, a problem first posed by Chung and Garey. We prove sharp bounds fo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dris___00893::46b94290850c1b0ada4a938d4b37ec29
https://hdl.handle.net/1874/305101

Zobrazit plný text záznamu

Autor: Mathew A. Harris, Thomas Wolbers

Publikováno v: Harris, M A & Wolbers, T 2014, ' How age-related strategy switching deficits affect wayfinding in complex environments ', Neurobiology of Aging, vol. 35, no. 5, pp. 1095-1102 . https://doi.org/10.1016/j.neurobiolaging.2013.10.086
Neurobiology of aging 35(5), 1095-1102 (2014). doi:10.1016/j.neurobiolaging.2013.10.086

Although most research on navigation in aging focuses on allocentric processing deficits, impaired strategy switching may also contribute to navigational decline. Using a specifically designed task involving navigating a town-like virtual environment

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e518a4a6909526489d7a88d7a8f3b6ff
https://pubmed.ncbi.nlm.nih.gov/24239438

Zobrazit plný text záznamu

Cognitive maps and spatial inference in animals: Rats fail to take a novel shortcut, but can take a previously experienced one

Autor: Dudchenko, Paul, Grieves, Roderick

Previous work has shown that children are able to make a spatial inference about adjacent locations that have only been experienced indirectly (Hazen, Lockman, & Pick, 1978). We sought to replicate this finding in rats, on a conceptually analogous ta

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=core_ac_uk__::55c9b354838ab0d5ed82589f3511952e

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání