Collaborative power management in WPANs using rational controllers: a case study.
Collective tree spanners and routing in AT-free related graphs.
Collision patterns on mollusc shells.
Colored decision process Petri nets: modeling, analysis and stability
In this paper we introduce a new modeling paradigm for developing a decision process representation called the Colored Decision Process Petri Net (CDPPN). It extends the Colored Petri Net (CPN) theoretic approach including Markov decision processes. CPNs are used for process representation taking advantage of the formal semantic and the graphical display. A Markov decision process is utilized as a tool for trajectory planning via a utility function. The main point of the CDPPN is its ability to...
Color-texture-based image retrieval system using Gaussian Markov random field model.
Combination of mobile agent and evolutionary algorithm to optimize the client transport services
This paper presents a migration strategy for a set of mobile agents (MAs) in order to satisfy customers' requests in a transport network, through a multimodal information system. In this context, we propose an optimization solution which operates on two levels. The first one aims to constitute a set of MAs building their routes, called Workplans. At this level, Workplans must incorporate all nodes, representing information providers in the multimodal network, in order to explore it completely....
Combinatoire de mots récurrents de complexité n+2
Nous établissons quelques propriétés des mots sturmiens et classifions, ensuite, les mots infinis qui possèdent, pour tout entier naturel non nul n, exactement n+2 facteurs de longueur n. Nous définissons également la notion d'insertion k à k sur les mots infinis puis nous calculons la complexité des mots obtenus en appliquant cette notion aux mots sturmiens. Enfin nous étudions l'équilibre et la palindromie d'une classe particulière de mots de complexité n+2 que nous appelons mots quasi-sturmiens...
Combinatoire des codages de rotations
Combinatorial analysis of quicksort algorithm
Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers
We study some arithmetical and combinatorial properties of β-integers for β being the larger root of the equation x2 = mx - n,m,n ∈ ℵ, m ≥ n +2 ≥ 3. We determine with the accuracy of ± 1 the maximal number of β-fractional positions, which may arise as a result of addition of two β-integers. For the infinite word uβ> coding distances between the consecutive β-integers, we determine precisely also the balance. The word uβ> is the only fixed point of the morphism A → Am-1B and B → Am-n-1B. In...
Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.
Combinatorial homology in a perspective of image analysis.
Combinatorial interpretations of a generalization of the Genocchi numbers.
Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers
Combinatorial properties of infinite words associated with cut-and-project sequences
The aim of this article is to study certain combinatorial properties of infinite binary and ternary words associated to cut-and-project sequences. We consider here the cut-and-project scheme in two dimensions with general orientation of the projecting subspaces. We prove that a cut-and-project sequence arising in such a setting has always either two or three types of distances between adjacent points. A cut-and-project sequence thus determines in a natural way a symbolic sequence (infinite word)...
Combinatorial properties of one-dimensional arrangements.
Combinatorial properties of texts
Combinatorics of branchings in higher dimensional automata.
Combinatorics of singly-repairable families.
Combined complexity classes for finite functions