๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A group pursuit problem with phase constraints

โœ Scribed by N.N. Petrov

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
265 KB
Volume
52
Category
Article
ISSN
0021-8928

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On a group pursuit problem
On a group pursuit problem
โœ M. Pittsyk; A.A. Chikrii ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 391 KB
A pursuitโ€“evasion game with one curvatur
A pursuitโ€“evasion game with one curvature constraint
โœ Hung-Jen Chu; Jer-Guang Hsieh; Yuan-Shun Lee; Kuo-Hsien Hsia ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 197 KB

In this paper, a pursuit}evasion game, in which the pursuer moves with simple motion whereas the evader moves at a "xed speed but with a curvature constraint, is investigated. The game is the inverse of the usual homicidal chau!eur game. Square of the distance between the pursuer and the evader when

The hardest constraint problems: A doubl
The hardest constraint problems: A double phase transition
โœ Tad Hogg; Colin P. Williams ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1016 KB

The distribution of hard graph coloring problems as a function of graph connectivity is shown to have two distinct transition behaviors. The first, previously recognized, is a peak in the median search cost near the connectivity at which half the graphs have solutions. This region contains a high pr