Добірка наукової літератури з теми "Jeux sur les graphes"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Jeux sur les graphes".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Jeux sur les graphes"
Boussairi, Abderrahim, and Abdelhak Chaichaa. "Sur les graphes 2-reconstructibles." Comptes Rendus Mathematique 337, no. 7 (October 2003): 437–40. http://dx.doi.org/10.1016/j.crma.2003.08.002.
Повний текст джерелаHaouala, Ezzeddine. "Fonctions harmoniques sur les graphes." Archiv der Mathematik 47, no. 6 (December 1986): 545–51. http://dx.doi.org/10.1007/bf01189865.
Повний текст джерелаLehoucq, Roland. "Jeux d’ombres sur Pandora." Reflets de la physique, no. 49 (May 2016): 22–24. http://dx.doi.org/10.1051/refdp/201649022.
Повний текст джерелаDelmotte, T. "Inégalité de Harnack elliptique sur les graphes." Colloquium Mathematicum 72, no. 1 (1997): 19–37. http://dx.doi.org/10.4064/cm-72-1-19-37.
Повний текст джерелаJaffard, Stéphane. "Sur la dimension de boîte des graphes." Comptes Rendus de l'Académie des Sciences - Series I - Mathematics 326, no. 5 (March 1998): 555–60. http://dx.doi.org/10.1016/s0764-4442(98)85006-4.
Повний текст джерелаLemieux, Vincent. "L'articulation des réseaux sociaux." Recherches sociographiques 17, no. 2 (April 12, 2005): 247–60. http://dx.doi.org/10.7202/055716ar.
Повний текст джерелаFoucambert, Denis, Tracy Heranic, Christophe Leblay, Maarit Mutta, and Minjing Zhong. "Intégration de la visualisation dans l’analyse de processus complexes : écritures et réécritures dans un corpus multilingue universitaire." SHS Web of Conferences 138 (2022): 06010. http://dx.doi.org/10.1051/shsconf/202213806010.
Повний текст джерелаLafont, Robert. "Jeux onomastiques sur la frontière." Cahiers de praxématique, no. 8 (January 1, 1987): 77–95. http://dx.doi.org/10.4000/praxematique.3494.
Повний текст джерелаDecaestecker, Christine. "Sur les coloriages stables des graphes booliens exclusifs." Bulletin de la Classe des sciences 71, no. 1 (1985): 297–300. http://dx.doi.org/10.3406/barb.1985.57534.
Повний текст джерелаLannes, André. "Résolution d'ambiguı̈tés entières sur graphes interférométriques et GPS." Comptes Rendus de l'Académie des Sciences - Series I - Mathematics 333, no. 7 (October 2001): 707–12. http://dx.doi.org/10.1016/s0764-4442(01)02125-5.
Повний текст джерелаДисертації з теми "Jeux sur les graphes"
Duchêne, Eric. "Jeux combinatoires sur les graphes." Université Joseph Fourier (Grenoble), 2006. http://www.theses.fr/2006GRE10100.
Повний текст джерелаEveryone has ever played a combinatorial game, such as chess or checkers. The interest of mathematicians about this subject is often related to the search of a winning strategy for one of both players. From the game of Nim to chess, the complexity of this search is very variable. In this manuscript, we firstly give a short view of the main stages of the topic, who really started in the beginning of the XXth century. Besides, we emphasize the correlation between combinatorial games and number theory, error-correcting codes, or graph theory. We then investigate some variations of « classical » combinatorial games : Wythoff's game and Dots and Boxes. We detail the strategy and « good » game positions for the first and the second player. We then consider a solitaire variation of a recent two-player game : Clobber. It is a one-player game, where stones are placed on the vertices of a given graph. A move consisting in removing a stone (under some conditions), the goal is to minimize the number of remaining stones at the end. We give structural and algorithmic results about this game played on grids, trees or hypercubes
Schmidt, Simon. "Jeux à objectif compétitif sur les graphes." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM085/document.
Повний текст джерелаIn this thesis, we study three competitive optimization graph games. These games allow a dynamic approach to discrete optimization problems, which is an advantageous alternative way to consider these questions. The global idea consists in defining a combinatorial partisan game, associated to the original optimization problem, like coloring, domination, etc. Two players alternatively build the structure related to the optimization problem. One of them tries to obtain a structure as optimal as possible, whereas his opponent wants to prevent him from doing it. Under the hypothesis that both players play optimally, the size of the obtained structure defines a game invariant of the graph.We start by studying a 1-improper variation of the coloring game, which is the first and the most studied competitive optimization graph game. In this game, the players colors the vertices of a graph, such that two adjacent vertices do not share the same color. In the 1-improper version, we allow a vertex to have at most one neighbor with the same color as it. Then, we study the domination game, in which the players have to build a domination set, that is a sub-set of vertices such that any other vertex is adjacent to one of the vertex in this set. Finally, we define a new game, related to the distinguishing coloring problem. This game is about building a vertex-coloring which is preserved by none of the graph automorphisms. We raise some challenging open questions about this new game, especially concerning the characterization of graphs with infinite game invariant, by the existence of order two automorphisms
Cachat, Thierry. "Jeux sur des graphes d'automates à pile et leurs extensions." Rennes 1, 2004. http://www.theses.fr/2004REN10048.
Повний текст джерелаSerre, Olivier. "Contribution à l'étude des jeux sur des graphes de processus à pile." Phd thesis, Université Paris VIII Vincennes-Saint Denis, 2004. http://tel.archives-ouvertes.fr/tel-00011326.
Повний текст джерелаDans cette thèse, les graphes de jeu considérés sont des graphes de processus à pile qui offrent une représentation finie simple de systèmes infinis relativement complexes. Sur de tels graphes, on peut considérer des conditions de gain classiques (accessibilité, Büchi ou parité) mais aussi des conditions plus spécifiques au modèle comme celles portant sur le bornage de la pile. On peut également combiner ces dernières entre elles.
Une première contribution a été de fournir une représentation des ensembles de positions gagnantes pour les jeux de parité ainsi qu'une nouvelle présentation des résultats connus pour ces derniers. On a alors pu étendre de façon naturelle les techniques de preuves à d'autres conditions de gain, notamment à celles portant sur le bornage de la pile.
Une autre contribution a été la description d'une famille de conditions de gain de complexité borélienne arbitraire finie pour lesquelles les jeux (sur des graphes finis ou sur des graphes de processus à pile) restent décidables.
L'étude des jeux sur les graphes de BPA et sur les graphes de processus à compteur a permis de proposer des techniques propres à ces modèles qui fournissent alors des bornes de complexité meilleures que celles obtenues dans le cas général des graphes de processus à pile.
Enfin, une dernière contribution a été de proposer une solution pour les jeux sur des graphes de processus à pile munis de conditions combinant des conditions régulières et des conditions sur la hauteur de pile et pour des conditions décrites par des automates à pile avec visibilité.
GONZáLEZ, GóMEZ Mauricio. "Jeux stochastiques sur des graphes avec des applications à l’optimisation des smart-grids." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLN064.
Повний текст джерелаWithin the research community, there is a great interest in exploring many applications of energy grids since these become more and more important in our modern world. To properly design and implement these networks, advanced and complex mathematical tools are necessary. Two key features for their design are correctness and optimality. While these last two properties are in the core of formal methods, their effective application to energy networks remains largely unexploited. This constitutes one strong motivation for the work developed in this thesis. A special emphasis is made on the generic problem of scheduling power consumption. This is a scenario in which the consumers have a certain energy demand and want to have this demand fulfilled before a set deadline (e.g., an Electric Vehicle (EV) has to be recharged within a given time window set by the EV owner). Therefore, each consumer has to choose at each time the consumption power (by a computerized system) so that the final accumulated energy reaches a desired level. The way in which the power levels are chosen is according to a ``strategy’’ mapping at any time the relevant information of a consumer (e.g., the current accumulated energy for EV-charging) to a suitable power consumption level. The design of such strategies may be either centralized (in which there is a single decision-maker controlling all strategies of consumers), or decentralized (in which there are several decision-makers, each of them representing a consumer). We analyze both scenarios by exploiting ideas originating from formal methods, game theory and optimization. More specifically, the power consumption scheduling problem can be modelled using Markov decision processes and stochastic games. For instance, probabilities provide a way to model the environment of the electrical system, namely: the noncontrollable part of the total consumption (e.g., the non-EV consumption). The controllable consumption can be adapted to the constraints of the distribution network (e.g., to the maximum shutdown temperature of the electrical transformer), and to their objectives (e.g., all EVs are recharged). At first glance, this can be seen as a stochastic system with multi-constraints objectives. Therefore, the contributions of this thesis also concern the area of multi-criteria objective models, which allows one to pursue several objectives at a time such as having strategy designs functionally correct and robust against changes of the environment
Comin, Carlo. "Complexité dans les Jeux Infinis sur les Graphes et les Réseaux de Contraintes Temporelles." Thesis, Paris Est, 2017. http://www.theses.fr/2017PESC1061/document.
Повний текст джерелаThis dissertation deals with a number of algorithmic problems motivated by automated temporal planning and formal verification of reactive and finite state systems. We focused on game theoretical methods to obtain novel insights, improved complexity bounds, and faster algorithms for the following models: Hyper Temporal Networks, Conditional Simple/Hyper Temporal Networks, Update Games, Muller McNaughton Games, and Mean Payoff Games
Marcoux, Héli. "Jeux de poursuite policier-voleur sur un graphe - Le cas du voleur rapide." Thesis, Université Laval, 2014. http://www.theses.ulaval.ca/2014/30386/30386.pdf.
Повний текст джерелаGraph searching problems can be expressed as a game where a group of searchers is trying to capture a group of fugitives on a graph. When players move alternately in such a game, we are then referring to games of Cops and Robbers. Nowakowski and Winkler [28], and independently Quilliot [45], introduced the very first version of cops and robbers games in which a single cop tries to capture a single robber, both players moving alternately from their current positions to neighboring vertices. They notably proposed a very nice characterization of graphs that are winning for the cop, which is based on a particular dismantling scheme of the graph’s vertices; a dismantling scheme consisting in removing one by one each vertex of the graph by following a given rule. This dismantling-like characterization is furthermore interesting since it directly yields a divide-and-conquer algorithm that is polynomial, to solve the cop and robber problem. In this master thesis, we propose a new version of cops and robbers games in which the robber is able to move arbitrarily fast in the graph and in which the cop has a watching area that limits the robber’s moving capabilities. We characterize the cop-winning graphs for this new game by using some dismantling scheme similar to the one given by Nowakowski and Winkler [28], Quilliot [45], but that better fits our new game’s conditions. To obtain this dismantling-like characterization, we particularly need to generalize the definition of a classical graph to an undergrounded graph, whose vertices are split in a set of light vertices and a set of dark vertices. We also give an algorithm that provides a monotonous cop-winning strategy by making sure the cop is securing more and more vertices at each turn.
Sérée, Bastien. "Problèmes d'optimisation des les graphes paramétrés." Electronic Thesis or Diss., Ecole centrale de Nantes, 2022. http://www.theses.fr/2022ECDN0066.
Повний текст джерелаWe are considering weighted oriented graphs with parametrized energy. Firstly we propose an algorithm that, given a graph and one of its vertices, returns trees, every tree representing shortest-paths from the source to every other vertex for a particular zone of the parameter space. Moreover, union of these zones is a covering of the parameter space. Then we consider reachability in graphs with multi-dimensional energy, with stricter constraints that enforce the energy to stay between bounds. We prove decidabilty and complexity of this problem regardless of the dimension and the number of parameters when parameters take integer values. We alsoprove the undecidability of this problem when there is at least one parameter and the dimension is at least two. Finally we study paritygames on parametrized graphs with one and two players whose objective is the conjunction of a qualitative condition on the parity andquantitative one : energy must stay positive. We show the decidability and prove bounds on the complexity of the problem of searchinga winning strategy in both cases with one and two players
Hagenbach, Jeanne. "Communication stratégique et réseaux." Phd thesis, Université Panthéon-Sorbonne - Paris I, 2009. http://tel.archives-ouvertes.fr/tel-00450632.
Повний текст джерелаDavid, Vincent. "Algorithmique parallèle sur les arbres de décision et raisonnement en temps contraint : étude et application au minimax." Toulouse, ENSAE, 1993. http://www.theses.fr/1993ESAE0008.
Повний текст джерелаКниги з теми "Jeux sur les graphes"
Marc, Dandreau, ed. Jeux sur Internet et Compuserve. Paris: Sybex, 1995.
Знайти повний текст джерелаRomilly, Jacqueline de. Jeux de lumière sur l'Hellade. Saint-Clément-de-Riviere: Fata Morgana, 1996.
Знайти повний текст джерелаHubert, Legault Paul, and Matte Marie-Véronique, eds. Jeux de vie: S'ouvrir sur soi. Montréal: Éditions Québecor, 2011.
Знайти повний текст джерелаDamour, Christophe, Arnaud Duprat, and Hélène Valmary. Paradoxes sur l'acteur numérique: Jeux, corps, personas. Rennes: Presses universitaires de Rennes, 2022.
Знайти повний текст джерелаMontmort, Pierre Rémond de. Essay d'analyse sur les jeux de hazard. 2nd ed. Paris : J. Quillau: Providence, R.I., 2005.
Знайти повний текст джерелаJeux littéraires: Questions-réponses sur la littérature. [Paris]: Gallimard, 2012.
Знайти повний текст джерелаIchbiah, Daniel. La saga des jeux vidéo: Enquête sur le nouvel Eldorado des jeux vidéo. Paris: Pocket, 1998.
Знайти повний текст джерелаde, Baecque Antoine, ed. Calembours et autres jeux sur les mots d'esprit. Paris: Payot, 2000.
Знайти повний текст джерелаJeux de mémoires: Regards croisés sur la musique. Paris: Harmattan, 2013.
Знайти повний текст джерелаJeux interdits: Essai sur le Décalogue de Kieślowski. Québec]: Presses de l'Université Laval, 2014.
Знайти повний текст джерелаЧастини книг з теми "Jeux sur les graphes"
Ancona, A. "Theorie du Potentiel sur les Graphes et les Varietes." In Lecture Notes in Mathematics, 3–112. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/bfb0103041.
Повний текст джерелаDellacherie, C. "Quelques resultats sur les maisons de jeux analytiques." In Lecture Notes in Mathematics, 222–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/bfb0075851.
Повний текст джерелаFreyburger, Gérard. "Les annalistes dans l’enquête de Censorinus sur les Jeux Séculaires." In Recherches sur les Rhétoriques Religieuses, 51–63. Turnhout, Belgium: Brepols Publishers, 2020. http://dx.doi.org/10.1484/m.rrr-eb.5.121308.
Повний текст джерелаDeschamps, Lucienne. "Jeux grivois sur le vocabulaire religieux dans les Satires Ménippées de Varron ?" In Recherches sur les Rhétoriques Religieuses, 53–65. Turnhout, Belgium: Brepols Publishers, 2021. http://dx.doi.org/10.1484/m.rrr-eb.5.126671.
Повний текст джерелаBroze, Michèle, and René Preys. "Les «noms cachés» d’Amon: jeux de signes et rituels sur la porte ptolémaïque du deuxième pylône du temple de Karnak." In "Parcourir l'éternité". Hommages à Jean Yoyotte, 183–95. Turnhout: Brepols Publishers, 2012. http://dx.doi.org/10.1484/m.behe-eb.4.00421.
Повний текст джерела"19. Retour sur l'arbre léger." In À la découverte des graphes et des algorithmes de graphes, 179–90. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2102-0-019.
Повний текст джерела"19. Retour sur l'arbre léger." In À la découverte des graphes et des algorithmes de graphes, 179–90. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2102-0.c019.
Повний текст джерела"JEUX SUR LES FORMES." In La création des jeux de mots et des bons mots, 143–74. Presses de l'Université Laval, 2021. http://dx.doi.org/10.2307/j.ctv1hcg0hv.10.
Повний текст джерелаCampanella, Salvatore, and Emmanuel Streel. "Jeux de mémoire sur internet." In Psychopathologie et neurosciences, 301. De Boeck Supérieur, 2008. http://dx.doi.org/10.3917/dbu.campa.2008.01.0301.
Повний текст джерелаIreland, Alice M., and Nathaniel Payne. "L’effet des jeux violents sur l’apprentissage." In Jeux et simulations éducatifs, 421–38. Presses de l'Université du Québec, 2010. http://dx.doi.org/10.2307/j.ctv18pgk91.25.
Повний текст джерелаТези доповідей конференцій з теми "Jeux sur les graphes"
Chaboissier, Jonathan, and Frédéric Vernier. "Conception de jeux interactifs temps réel sur tabletop." In the 21st International Conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1629826.1629876.
Повний текст джерелаChabridon, Sophie, and Christophe Kodrnja. "Synchronisation dans les jeux multijoueurs sur téléphone mobile." In the 2nd French-speaking conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1102613.1102626.
Повний текст джерелаVandromme, Johann. "Un bureau basé sur les instruments et des graphes." In the 19th International Conference of the Association Francophone d'Interaction Homme-Machine. New York, New York, USA: ACM Press, 2007. http://dx.doi.org/10.1145/1541436.1541489.
Повний текст джерелаCornulier, Benoît de. "Sur la versification du Jus de Saint Nicolai de Jehan Bodel (vers 1200)." In Manuscrits, mètres, performances: les Jeux d'Arras, du théâtre médiéval? Fabula, 2009. http://dx.doi.org/10.58282/colloques.1189.
Повний текст джерелаSicard, L., and R. Khonsari. "Conséquences dentaires de la dysjonction pterygo-maxillaire pendant les chirugies d’avancée fronto-faciale monobloc dans le traitement des syndromes de Crouzon." In 66ème Congrès de la SFCO. Les Ulis, France: EDP Sciences, 2020. http://dx.doi.org/10.1051/sfco/20206602001.
Повний текст джерела