نتایج جستجو برای: detour index

تعداد نتایج: 396908  

Journal: :Behavioural brain research 1997
A Bisazza R Pignatti G Vallortigara

We studied detour responses of male mosquitofish faced with a vertical-bar barrier through which a group of females was visible. Mosquitofish showed a consistent population bias to detour the barrier preferentially leftwise when a straight barrier was used, whilst the asymmetry disappeared if a U-shaped barrier was used. The leftward bias was apparent even when using a simulated-predator as a t...

Journal: :Journal of Graph Theory 1999
Peter Hamburger Alexandr V. Kostochka Alexander Sidorenko

A minimal detour subgraph of the n-dimensional cube is a spanning subgraph G of Qn having the property that for vertices x, y of Qn, distances are related by dG(x; y) dQn(x; y) + 2. For a spanning subgraph G of Qn to be a local detour subgraph, we require only that the above inequality be satis ed whenever x and y are adjacent in Qn. Let f(n) (respectively, fl(n) ) denote the minimum number of ...

2018
Huanyang Zheng Jie Wu

This paper studies a promising application in Vehicular Cyber-Physical Systems (VCPS) called roadside advertisement dissemination. Its application involves three elements: the drivers in the vehicles, Roadside Access Points (RAPs), and shopkeepers. The shopkeeper wants to attract as many customers as possible by using RAPs to disseminate advertisements to the passing vehicles. Upon receiving an...

2005
Péter Pongrácz Ádám Miklósi Viktória Vida Vilmos Csányi

There are many indications and much practical knowledge about the different tasks which various breeds of dogs are selected for. Correspondingly these different breeds are known to possess different physical and mental abilities. We hypothesized that commonly kept breeds will show differences in their problem solving ability in a detour task around a V-shaped fence, and also, that breed differe...

Journal: :Critical Social Work 2019

2004
Joon Shik Lim S. Sitharama Iyengar Si-Qing Zheng

This paper presents new heuristic algorithms using the guided A* search method : Guided Minimum Detour (GMD) algorithm and Line-by-Line Guided Minimum Detour (LGMD) algorithm for finding optimal rectilinear (L,) shortest paths in the presence of rectilinear obstacles. The GMD algorithm runs O(nhr(1ogN) + tN) in time and takes O(N) in space, where N is the number of extended line segments includ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید