Results 51 to 60 of about 7,220 (158)
Journal of Advanced Transportation, 2017 The constantly increasing number of cars in the megacities is causing severe parking problems. To resolve this problem, many cities adopt parking guidance system as a part of intelligent transportation system (ITS).
Jong-Ho Shin +3 more
doaj +1 more source
G-parking functions and tree inversions [PDF]
Combinatorica, 2015 10 pages, 3 figures; to appear in ...
David Perkinson, Qiaoyu Yang, Kuai Yu
openaire +2 more sources
Counting parking sequences and parking assortments through permutations [PDF]
Enumerative Combinatorics and Applications, 2023 Spencer J. Franks +4 more
doaj +1 more source
Enumeration of minimal acyclic automata via generalized parking functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We give an exact enumerative formula for the minimal acyclic deterministic finite automata. This formula is obtained from a bijection between a family of generalized parking functions and the transitions functions of acyclic automata.
Jean-Baptiste Priez
doaj +1 more source
Journal of Combinatorial Theory, Series A, 1975 AbstractA large class of one-to-one correspondences is given between acyclic and parking functions, generalizing a previous construction given by Foata and Riordan.
openaire +1 more source
Coding Parking Functions by Pairs of Permutations [PDF]
The Electronic Journal of Combinatorics, 2003 We introduce a new class of admissible pairs of triangular sequences and prove a bijection between the set of admissible pairs of triangular sequences of length $n$ and the set of parking functions of length $n$. For all $u$ and $v=0,1,2,3$ and all $n\le 7$ we describe in terms of admissible pairs the dimensions of the bi-graded components $h_{u,v ...
Yurii Burman, Michael Shapiro 0004
openaire +3 more sources
Orientations, Semiorders, Arrangements, and Parking Functions [PDF]
The Electronic Journal of Combinatorics, 2012 It is known that the Pak-Stanley labeling of the Shi hyperplane arrangement provides a bijection between the regions of the arrangement and parking functions. For any graph $G$, we define the $G$-semiorder arrangement and show that the Pak-Stanley labeling of its regions produces all $G$-parking functions.
Sam Hopkins 0002, David Perkinson
openaire +3 more sources
Parking Functions: From Combinatorics to Probability
Methodology and Computing in Applied Probability, 2022 Abstract Suppose that m drivers each choose a preferred parking space in a linear car park with n spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If all drivers park successfully, the sequence of choices is called a parking function.
Kenyon, Richard, Yin, Mei
openaire +3 more sources
Design and research on the electronic parking brake system of the medium and heavy duty vehicles
Journal of Hebei University of Science and Technology, 2015 Focusing on auto control of parking brake system of the medium and heavy duty vehicles, the key problems are studied including the system design and control strategies.
Hongliang WANG +3 more
doaj +1 more source
Permutation invariant parking assortments [PDF]
Enumerative Combinatorics and Applications, 2023 Douglas M. Chen +4 more
doaj +1 more source