Search results for "Computation Theory & Mathematics"
showing 10 items of 332 documents
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
2021
Abstract The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously selecting suppliers and routing a fleet of homogeneous vehicles to purchase different products at the selected suppliers so that all product demands are fulfilled and traveling and purchasing costs are minimized. We consider variants of the MVTPP in which the capacity of the vehicles can become binding and the demand for each product is one unit. Corresponding solution algorithms from the literature are either branch-and-cut or branch-and-price algorithms, where in the latter case the route-generation subproblem is solved on an expanded graph by applying standard dynamic-programming techniques. Our …
Conocimiento acerca de las estrategias de práctica instrumental al inicio del Grado Superior de Música
2017
Cabe pensar que un estudiante de instrumento que accede al Grado Superior de Música, tras aproximadamente 10 años de formación, debería tener una práctica efectiva y, por lo tanto, un manejo adecuado de numerosas estrategias. En este sentido, el estudio se planteó con objeto de corroborar el estado de conocimientos previos de los estudiantes que ingresan al Conservatorio Superior de Música de Aragón con respecto a diversas estrategias de práctica instrumental de eficacia avalada por investigaciones previas y/o la experiencia profesional de grandes intérpretes. La investigación de carácter descriptivo presenta una metodología de carácter cualitativo en la que las técnicas de recogida de dato…
The Average State Complexity of the Star of a Finite Set of Words Is Linear
2008
We prove that, for the uniform distribution over all sets Xof m(that is a fixed integer) non-empty words whose sum of lengths is n, $\mathcal{D}_X$, one of the usual deterministic automata recognizing X*, has on average $\mathcal{O}(n)$ states and that the average state complexity of X*is i¾?(n). We also show that the average time complexity of the computation of the automaton $\mathcal{D}_X$ is $\mathcal{O}(n\log n)$, when the alphabet is of size at least three.
Dual Inequalities for Stabilized Column Generation Revisited
2014
Column generation (CG) models have several advantages over compact formulations: they provide better linear program bounds, may eliminate symmetry, and can hide nonlinearities in their subproblems. However, users also encounter drawbacks in the form of slow convergence, also known as the tailing-off effect, and the oscillation of the dual variables. Among different alternatives for stabilizing the CG process, Ben Amor et al. [Ben Amor H, Desrosiers J, Valério de Carvalho JM (2006) Dual-optimal inequalities for stabilized column generation. Oper. Res. 54(3):454–463] suggest the use of dual-optimal inequalities (DOIs) in the context of cutting stock and bin packing problems. We generalize th…
Distributed Leader Election and Computation of Local Identifiers for Programmable Matter
2019
International audience; The context of this paper is programmable matter, which consists of a set of computational elements, called particles, in an infinite graph. The considered infinite graphs are the square, triangular and king grids. Each particle occupies one vertex, can communicate with the adjacent particles, has the same clockwise direction and knows the local positions of neighborhood particles. Under these assumptions, we describe a new leader election algorithm affecting a variable to the particles, called the k-local identifier, in such a way that particles at close distance have each a different k-local identifier. For all the presented algorithms, the particles only need a O(…
Highly transitive actions of groups acting on trees
2015
We show that a group acting on a non-trivial tree with finite edge stabilizers and icc vertex stabilizers admits a faithful and highly transitive action on an infinite countable set. This result is actually true for infinite vertex stabilizers and some more general, finite of infinite, edge stabilizers that we call highly core-free. We study the notion of highly core-free subgroups and give some examples. In the case of amalgamated free products over highly core-free subgroups and HNN extensions with highly core-free base groups we obtain a genericity result for faithful and highly transitive actions. In particular, we recover the result of D. Kitroser stating that the fundamental group of …
Maux de l'économie, mots des économistes
1990
International audience; La méthodologie économique a largement séparé les discours (hypthèses, théorie, corps de pensée) de l'action (représentée essentiellement par les applications ou les descriptions monographiques). Dans cet essai, avec la plus large prudence répondant à une démarche balbutiante, nous tentons de donner des représentations synthétiques, sur longue période, de l'évolution de la littérature économique ; ceci au moyen des méthodes usuelles de l'analyse des données. Il reste, quelque soit les résultats auxquels nous parvenons, que ce type de traintement repose sur l'hypothèse d'avoir pris en compte chaque production de littérature comme un objet statistique simple. L'applica…
Qualifying semantic graphs using model checking
2011
International audience; Semantic interoperability problems have found their solutions using languages and techniques from the Semantic Web. The proliferation of ontologies and meta-information has improved the understanding of information and the relevance of search engine responses. However, the construction of semantic graphs is a source of numerous errors of interpretation or modeling and scalability remains a major problem. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border of two areas: the semantic web and the model checking. This line of research concerns t…
Preprocessing of region of interest localization based on local surface curvature analysis for three-dimensional reconstruction with multiresolution
2009
We present an approach to integrate a preprocessing step of the region of interest ROI localization into 3-D scanners laser or ste- reoscopic. The definite objective is to make the 3-D scanner intelligent enough to localize rapidly in the scene, during the preprocessing phase, the regions with high surface curvature, so that precise scanning will be done only in these regions instead of in the whole scene. In this way, the scanning time can be largely reduced, and the results contain only per- tinent data. To test its feasibility and efficiency, we simulated the prepro- cessing process under an active stereoscopic system composed of two cameras and a video projector. The ROI localization is…
The pure descent statistic on permutations
2017
International audience; We introduce a new statistic based on permutation descents which has a distribution given by the Stirling numbers of the first kind, i.e., with the same distribution as for the number of cycles in permutations. We study this statistic on the sets of permutations avoiding one pattern of length three by giving bivariate generating functions. As a consequence, new classes of permutations enumerated by the Motzkin numbers are obtained. Finally, we deduce results about the popularity of the pure descents in all these restricted sets. (C) 2017 Elsevier B.V. All rights reserved.