Moderate Growth Time Series for Dynamic Combinatorics Modelisation

Simple item page
dc.creatorJaff, Luaï
dc.creatorDuchamp, Gérard H. E.
dc.creatorKacem, Hatem Hadj
dc.creatorBertelle, Cyrille
dc.date2007-08-16
dc.date.accessioned2026-07-07T08:23:55Z
dc.date.available2026-07-07T08:23:55Z
dc.descriptionHere, we present a family of time series with a simple growth constraint. This family can be the basis of a model to apply to emerging computation in business and micro-economy where global functions can be expressed from local rules. We explicit a double statistics on these series which allows to establish a one-to-one correspondence between three other ballot-like strunctures.
dc.identifierhttps://arxiv.org/abs/0708.2213
dc.identifierhttp://arxiv.org/abs/0708.2213
dc.identifierECELM-2, Tirgu-Mures : Roumanie (2006)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/136168
dc.subjectSymbolic Computation
dc.subjectMultiagent Systems
dc.subjectCombinatorics
dc.titleModerate Growth Time Series for Dynamic Combinatorics Modelisation
dc.typetext

Files

Collections

arXiv