Contents
Academic literature on the topic 'Combinatoire des coeurs'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Combinatoire des coeurs.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Dissertations / Theses on the topic "Combinatoire des coeurs"
Vander-Swalmen, Pascal. "Aspects parallèles des problèmes de satisfaisabilité." Phd thesis, Université de Reims - Champagne Ardenne, 2009. http://tel.archives-ouvertes.fr/tel-00545657.
Full textChakroun, Imen. "Algorithmes Branch and Bound parallèles hétérogènes pour environnements multi-coeurs et multi-GPU." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2013. http://tel.archives-ouvertes.fr/tel-00841965.
Full textPaegelow, Raphaël. "Action des sous-groupes finis de SL2(C) sur la variété de carquois de Nakajima du carquois de Jordan et fibrés de Procesi." Electronic Thesis or Diss., Université de Montpellier (2022-....), 2024. http://www.theses.fr/2024UMONS005.
Full textIn this doctoral thesis, first of all, we have studied the decomposition into irreducible components of the fixed point locus under the action of Γ a finite subgroup of SL2(C) of the Nakajima quiver variety of Jordan’s quiver. The quiver variety associated with Jordan’s quiver is either isomorphic to the punctual Hilbert scheme in C2 or to the Calogero-Moser space. We have described the irreducible components using quiver varieties of McKay’s quiver associated with the finite subgroup Γ. We were then interested in the combinatorics coming out of the indexing set of these irreducible components using an action of the affine Weyl group introduced by Nakajima. Moreover, we have constructed a combinatorial model when Γ is of type D, which is the only original and remarkable case. Indeed, when Γ is of type A, such work has already been done by Iain Gordon and if Γ is of type E, we have shown that the fixed points that are also fixed under the maximal diagonal torus of SL2(C) are the monomial ideals of the punctual Hilbert scheme in C2 indexed by staircase partitions. To be more precise, when Γ is of type D, we have obtained a model of the indexing set of the irreducible components containing a fixed point of the maximal diagonal torus of SL2(C) in terms of symmetric partitions. Finally, if n is an integer greater than 1, using the classification of the projective, symplectic resolutions of the singularity (C2)n/Γn where Γn is the wreath product of the symmetric group on n letters Sn with Γ, we have obtained a description of all such resolutions in terms of irreducible components of the Γ-fixedpoint locus of the Hilbert scheme of points in C2.Secondly, we were interested in the restriction of two vector bundles over a fixed irreducible component of the Γ-fixed point locus of the punctual Hilbert scheme in C2. The first vector bundle is the tautological vector bundle that we have expressed the restriction in terms of Nakajima’s tautological vector bundle on the quiver variety of McKay’s quiver associated with the fixed irreducible component. The second vector bundle is the Procesi bundle. This vector bundle was introduced by Marc Haiman in his work proving the n! conjecture. We have studied the fibers of this bundle as (Sn × Γ)-module. In the first part of the chapter of this thesis dedicated to the Procesi bundle, we have shown a reduction theorem that expresses the (Sn × Γ)-module associated with the fiber of the restriction of the Procesi bundle over an irreducible component C of the Γ-fixed point locus of Hilbert scheme of n points in C2 as the induced of the fiber of the restriction of the Procesi bundle over an irreducible component of the Γ-fixed point locus of the Hilbert scheme of k points in C2 where k ≤ n is explicit and depends on the irreducible component C and Γ. This theorem is then proven with other tools in two edge cases when Γ is of type A. Finally, when Γ is of type D, some explicit reduction formulas of the restriction of the Procesi bundle to the Γ-fixed point locus have been obtained.To finish, if l is an integer greater than 1, then in the case where Γ is the cyclic group of order l contained in the maximal diagonal torus of SL2(C) denoted by µl, the reduction theorem restricts the study of the fibers of the Procesi bundle over the µl-fixed points of the punctual Hilbert scheme in C2 to the study of the fibers over points in the Hilbert scheme associated with monomial ideals parametrized by the l-cores. The (Sn × Γ)-module that one obtains seems to be related to the Fock space of the Kac-Moody algebra ˆsll(C). A conjecture in this direction has been stated in the last chapter
Berger, Karl-Eduard. "Placement de graphes de tâches de grande taille sur architectures massivement multicoeurs." Thesis, Université Paris-Saclay (ComUE), 2015. http://www.theses.fr/2015SACLV026/document.
Full textThis Ph.D thesis is devoted to the study of the mapping problem related to massively parallel embedded architectures. This problem arises from industrial needs like energy savings, performance demands for synchronous dataflow applications. This problem has to be solved considering three criteria: heuristics should be able to deal with applications with various sizes, they must meet the constraints of capacities of processors and they have to take into account the target architecture topologies. In this thesis, tasks are organized in communication networks, modeled as graphs. In order to determine a way of evaluating the efficiency of the developed heuristics, mappings, obtained by the heuristics, are compared to a random mapping. This comparison is used as an evaluation metric throughout this thesis. The existence of this metric is motivated by the fact that no comparative heuristics can be found in the literature at the time of writing of this thesis. In order to address this problem, two heuristics are proposed. They are able to solve a dataflow process network mapping problem, where a network of communicating tasks is placed into a set of processors with limited resource capacities, while minimizing the overall communication bandwidth between processors. They are applied on task graphs where weights of tasks and edges are unitary set. The first heuristic, denoted as Task-wise Placement, places tasks one after another using a notion of task affinities. The second algorithm, named Subgraph-wise Placement, gathers tasks in small groups then place the different groups on processors using a notion of affinities between groups and processors. These algorithms are tested on tasks graphs with grid or logic gates network topologies. Obtained results are then compared to an algorithm present in the literature. This algorithm maps task graphs with moderated size on massively parallel architectures. In addition, the random based mapping metric is used in order to evaluate results of both heuristics. Then, in a will to address problems that can be found in industrial cases, application cases are widen to tasks graphs with tasks and edges weights values similar to those that can be found in the industry. A progressive construction heuristic named Regret Based Approach, based on game theory, is proposed. This heuristic maps tasks one after another. The costs of mapping tasks according to already mapped tasks are computed. The process of task selection is based on a notion of regret, present in game theory. The task with the highest value of regret for not placing it, is pointed out and is placed in priority. In order to check the strength of the algorithm, many types of task graphs (grids, logic gates networks, series-parallel, random, sparse matrices) with various size are generated. Tasks and edges weights are randomly chosen using a bimodal law parameterized in order to have similar values than industrial applications. Obtained results are compared to the Task Wise placement, especially adapted for non-unitary values. Moreover, results are evaluated using the metric defined above
Clavaud, Cécile. "Développement de ligands de protéines par assemblage combinatoire autour d'un coeur de rheniumV : application à la cyclophiline hCyp-18." Paris 11, 2006. http://www.theses.fr/2006PA112006.
Full textThis manuscript describes the development of a novel strategy for the synthesis of organometallic compounds usable as protein ligands, pharmacophores and tracers for molecular imaging through combinatorial assembly of independent modules. Each supramolecular entity is composed of two molecules A and B which are able to coordinate a metal core M in a complementary and unambiguous way to give a metal complex A-M-B. Among a wide variety of metal cores utilized in supramolecular chemistry and nuclear medicine, we selected the oxorhenium and oxotechnetium cores which feature similar interesting chemical and radiochemical properties. The main goal of this work was to validate the strategy in vitro using a model protein, the human cyclophilin hCyp-18, a peptidylprolyl isomerase (PPIases) implicated in numerous biological processes and diseases. Moreover, hCyp-18 possesses two functionally independent subsites which have been thoroughly characterized by NMR, X-ray crystallography and structure activity relationship studies. We developed novel metallated cyclophilin ligands through oxorhenium coordination of independent peptide moieties which reconstitute a canonic PPIase substrate, tetrapeptide Suc-AAPF-pNA. Assembly and biochemical screening of two libraries led to the selection of 2 complexes which exhibit affinities improved by one order of magnitude relative to the reference peptide. Moreover, a Cys-pNA oxorhenium coordinate devoid of proline analog displayed an interesting affinity for cyclophilin. We also initiated the evolutionary selection of cyclophilin ligands via a dynamic combinatorial chemistry
Guilmaine, Anne-Marie. "Au détour de juin, en plein coeur des ambivalences (titre provisoire pour création à géométrie variable) : la pluralité des possibles ou la mise en jeu d'une combinatoire scénique par le biais du performatif." Mémoire, 2006. http://www.archipel.uqam.ca/3052/1/M9444.pdf.
Full text