[PDF] Top 20 Label-Guided Graph Exploration by a Finite Automaton

... for graph exploration was introduced by Shannon [Shannon, ...of graph exploration by a finite ...no finite automaton with a finite ... Voir le document complet

... the exploration capabilities of a robot with restricted memory ...model a robot as a finite automaton and measure its memory by the number of ...states. A given ... Voir le document complet

... The graph exploration problem becomes more challenging when the graph is anonymous ...no label). In such a context, several bounds have been ...complete a visit of the nodes ... Voir le document complet

... and a finite automaton using it, such that the automaton explores all graphs of size n within the period at most π(n)? Dobrev et ...presented a port-numbering algorithm, and an ... Voir le document complet

... of a timer (step counter) to alternate between phases of ignoring advice (R) and follow- ing advice (A) for a certain number of ...know by which edge it entered the node of its current lo- ... Voir le document complet

... has a dominant root β > 1 (see the next section for the definition), we are able to provide a more specific descrip- tion of the ...any automaton A arising from a numeration system ... Voir le document complet

... Demixing professionally produced music (PPM) is par- ticularly difficult for several reasons [11, 12, 17]. Firstly, the mix signals are generally underdetermined, i.e., there are more sources than mix channels. Secondly, ... Voir le document complet

... HAL Id: hal-02295947 https://hal.archives-ouvertes.fr/hal-02295947 Submitted on 24 Sep 2019 HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, ... Voir le document complet

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet

... through a pivotal decade from the mid-eighties to the ...thrive: automaton (semi)groups on the one hand with the works of Aleshin [2, 3] and Grigorchuk [24, 25] and the book [43], and automatic (semi)groups ... Voir le document complet

... is a partition of A associated with the strength of the graph G A = (A, ...of a given graph and therefore several possible ...subset A of N , to choose a ... Voir le document complet

... constructed a specific shared asset, a developing idea of territoriality symbolized by the Bleu Blanc d’Ardenne designation of origin, and which was emphasized in the various references to the ... Voir le document complet

... through a succession of large-scale ...formation, by using Hi-C data to guide our ...of a model – along with optimization problems Minimum Local Scenario and Minimum Local Parsimonious Scenario – de- ... Voir le document complet

... propose a finer static analysis on the basis of the alias calculus of the program to achieve a simpler ...in a disjunctive normal form (DNF) where each conjunction of P can be considered as a ... Voir le document complet

... is a classic optimisation problem that has been recently extended in the setting of ...generated by Mealy automata—a class that is often used to study group-theoretical conjectures—and prove that the ... Voir le document complet

... work by [Guo et ...textons, by visual learning. They infer the parameters of a texture model defin- ing the input image as the composed realizations of two stochas- tic texton ...described by ... Voir le document complet

... using a subset of ImageNet ...keep a similar underlying content in the images, compared to those of the backbone ...with a batch size of ...driven by a categorical cross-entropy loss. ... Voir le document complet

... for a particular value of the IVP solution x(ξ; xn−1) at an unknown time ξ ∈]tn, ...over a time interval [t n , t n+1 ], that is for all t ∈ [t n , t n+1 ], x(t; x n−1 ) ∈ [˜ ...) by [˜ ... Voir le document complet

... propose a novel user-assisted cage generation tool. We start from a digital char- acter and its skeleton, and create a coarse control cage for its ...is a volumetric field defined in the ... Voir le document complet

... use a species tree, in addition to a multiple sequence alignment, to model gene gains and losses inferred from the reconciliation between gene and species trees ...leave a large space for ... Voir le document complet