Gotowa bibliografia na temat „Variantes du problème du p-Centre”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Variantes du problème du p-Centre”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Variantes du problème du p-Centre"
K, Toungara. "Contribution à l'amélioration de la qualité de prise en charge du paludisme au Centre de Santé Communautaire de Sanankoroba dans le district sanitaire de Kalabancoro, Mali". Mali Santé Publique 10, nr 02 (20.04.2021): 34–39. http://dx.doi.org/10.53318/msp.v10i02.1794.
Pełny tekst źródłaAngelova, Lyudmila, Maria Tsvetkova i Mariya Levkova. "CHROMOSOMAL POLYMORPHISM IN BULGARIAN PATIENTS WITH REPRODUCTIVE PROBLEMS – ONE GENETIC CENTRE EXPERIENCE". Journal of IMAB - Annual Proceeding (Scientific Papers) 27, nr 4 (2.12.2021): 4133–38. http://dx.doi.org/10.5272/jimab.2021274.4133.
Pełny tekst źródłaLima de Paulo, Wanderlei, Marta Ines Velazco Fontova i Renato Canil de Souza. "An analysis of a mean-variance enhanced index tracking problem with weights constraints". Investment Management and Financial Innovations 15, nr 4 (19.11.2018): 183–92. http://dx.doi.org/10.21511/imfi.15(4).2018.15.
Pełny tekst źródłaDupin, Nicolas, Frank Nielsen i El-Ghazali Talbi. "Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front". Mathematics 9, nr 4 (23.02.2021): 453. http://dx.doi.org/10.3390/math9040453.
Pełny tekst źródłaYANG, LINMIN, ZHE DANG i OSCAR H. IBARRA. "ON STATELESS AUTOMATA AND P SYSTEMS". International Journal of Foundations of Computer Science 19, nr 05 (październik 2008): 1259–76. http://dx.doi.org/10.1142/s0129054108006261.
Pełny tekst źródłaSáez-Aguado, Jesús, i Paula Camelia Trandafir. "Variants of the $$ \varepsilon $$ ε -constraint method for biobjective integer programming problems: application to p-median-cover problems". Mathematical Methods of Operations Research 87, nr 2 (22.10.2017): 251–83. http://dx.doi.org/10.1007/s00186-017-0618-9.
Pełny tekst źródłaAndrei, Ionica. "Existence Theorems for Some Classes of Boundary Value Problems Involving the P(X)-Laplacian". Nonlinear Analysis: Modelling and Control 13, nr 2 (25.04.2008): 145–58. http://dx.doi.org/10.15388/na.2008.13.2.14575.
Pełny tekst źródłaЗахаров, И. В., В. Г. Терехов, А. Н. Соколовский i С. С. Зыкова. "Reconfiguration of the on-board complex of a mobile object based on modeling of variants of its structural degradation". Vestnik of Russian New University. Series «Complex systems: models, analysis, management», nr 4 (23.01.2023): 41–48. http://dx.doi.org/10.18137/rnu.v9187.22.04.p.39.
Pełny tekst źródłaHampl, Martin. "Territorial Administrative Division of Czech Republic - Conception Problems and Variants of Solution". Geografie 95, nr 4 (1990): 248–59. http://dx.doi.org/10.37040/geografie1990095040248.
Pełny tekst źródłaDiallo, MB, i Et Al. "Séroprévalence de l’hépatite B chez les femmes enceintes en consultation prénatale au centre de sante urbain Mafoudia de Dubreka (République de Guinée)." Revue Malienne d'Infectiologie et de Microbiologie 18, nr 1 (23.06.2023): 6–10. http://dx.doi.org/10.53597/remim.v18i1.2623.
Pełny tekst źródłaRozprawy doktorskie na temat "Variantes du problème du p-Centre"
Haddad, Marcel Adonis. "Nouveaux modèles robustes et probabilistes pour la localisation d'abris dans un contexte de feux de forêt". Electronic Thesis or Diss., Université Paris sciences et lettres, 2020. http://www.theses.fr/2020UPSLD021.
Pełny tekst źródłaThe location of shelters in different areas threatened by wildfires is one of the possible ways to reduce fatalities in acontext of an increasing number of catastrophic and severe forest fires. The problem is basically to locate p sheltersminimizing the maximum distance people will have to cover to reach the closest accessible shelter in case of fire. Thelandscape is divided in zones and is modeled as an edge-weighted graph with vertices corresponding to zones andedges corresponding to direct connections between two adjacent zones. Each scenario corresponds to a fire outbreak ona single zone (i.e., on a vertex) with the main consequence of modifying evacuation paths in two ways. First, an evacuationpath cannot pass through the vertex on fire. Second, the fact that someone close to the fire may have limited choice, ormay not take rational decisions, when selecting a direction to escape is modeled using a new kind of evacuation strategy.This evacuation strategy, called Under Pressure, induces particular evacuation distances which render our model specific.We propose two problems with this model: the Robust p-Center Under Pressure problem and the Probabilistic p-CenterUnder Pressure problem. First we prove hardness results for both problems on relevant classes of graphs for our context.In addition, we propose polynomial exact algorithms on simple classes of graphs and we develop mathematical algorithmsbased on integer linear programming
Yang, Chih-Shiang, i 楊智翔. "New Algorithmic Results on the Connected p-Center Problem and Its Variants". Thesis, 2010. http://ndltd.ncl.edu.tw/handle/91313818201500460028.
Pełny tekst źródła世新大學
資訊管理學研究所(含碩專班)
98
The essential p-Center problem is to determine a set of p vertices of a graph G for building facilities. The objective is to minimize the maximum access distance of clients at all vertices. Let G(V, E, l, w) be a n-vertex and m-edge graph with lengths on edges and weights on vertices. Given a graph G(V, E, l, w), a practical variant, called the Weighted Connected p-Center problem (the WCpC problem), is to find a p-center of G such that the maximum weighted access distance of clients at all vertices is minimized under the additional restriction in which requires the selected p-center induce a connected subgraph of G. If w(v) = 1, for all v in V, then the problem is abbreviated as the CpC problem. We first prove that the CpC problem is NP-Hard on planar graphs and interval graphs, respectively. Second, we propose two algorithms for the WCpC problem on trees with time-complexities O(pn) and O(n log2n), respectively, by different approaches. Meanwhile, if w(v) ? C, for all v in V, where C is a set of k numbers, for some small integer k, then another algorithm with time-complexity O(kn) is proposed. Next, the extension to graphs with forbidden vertices, called the Forbidden Weighted Connected p-Center problem (the FWCpC problem) is discussed. We show that the FWCpC problem can be also solved in O(n log2n) time. Finally, we propose an O(n) time algorithm for the FCpC problem on interval graphs with unit vertex-weights and unit edge-lengths.
Zhang, G., Marian Gheorghe, L. Q. Pan i M. J. Perez-Jimenez. "Evolutionary membrane computing: A comprehensive survey and new results". 2014. http://hdl.handle.net/10454/10830.
Pełny tekst źródłaEvolutionary membrane computing is an important research direction of membrane computing that aims to explore the complex interactions between membrane computing and evolutionary computation. These disciplines are receiving increasing attention. In this paper, an overview of the evolutionary membrane computing state-of-the-art and new results on two established topics in well defined scopes (membrane-inspired evolutionary algorithms and automated design of membrane computing models) are presented. We survey their theoretical developments and applications, sketch the differences between them, and compare the advantages and limitations. (C) 2014 Elsevier Inc. All rights reserved.
Książki na temat "Variantes du problème du p-Centre"
Gleń-Karolczyk, Katarzyna. Zabiegi ochronne kształtujące plonowanie zdrowotność oraz różnorodność mikroorganizmów związanych z czernieniem pierścieniowym korzeni chrzanu (Atmoracia rusticana Gaertn.). Publishing House of the University of Agriculture in Krakow, 2019. http://dx.doi.org/10.15576/978-83-66602-39-7.
Pełny tekst źródłaSvrakic, Dragan M., i Mirjana Divac Jovanovic. The Fragmented Personality. Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780190884574.001.0001.
Pełny tekst źródłaShapiro, Marc B. Between the Yeshiva World and Modern Orthodoxy. Liverpool University Press, 1999. http://dx.doi.org/10.3828/liverpool/9781874774525.001.0001.
Pełny tekst źródłaCzęści książek na temat "Variantes du problème du p-Centre"
Hofman, Piotr, Filip Mazowiecki i Philip Offtermatt. "Fast Termination and Workflow Nets". W Computer Aided Verification, 132–55. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37706-8_7.
Pełny tekst źródłaRoux, Nicolas, Rachel Chase, Ines van den Houwe, Chih-Ping Chao, Xavier Perrier, Jean-Pierre Jacquemoud-Collet, Julie Sardos i Mathieu Rouard. "Somaclonal variation in clonal crops: containing the bad, exploring the good." W Mutation breeding, genetic diversity and crop adaptation to climate change, 355–65. Wallingford: CABI, 2021. http://dx.doi.org/10.1079/9781789249095.0037.
Pełny tekst źródłaPillonetto, Gianluigi, Tianshi Chen, Alessandro Chiuso, Giuseppe De Nicolao i Lennart Ljung. "Classical System Identification". W Regularized System Identification, 17–31. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-95860-2_2.
Pełny tekst źródłaKlar, M., J. Mertes, M. Glatt, B. Ravani i J. C. Aurich. "A Holistic Framework for Factory Planning Using Reinforcement Learning". W Proceedings of the 3rd Conference on Physical Modeling for Virtual Manufacturing Systems and Processes, 129–48. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-35779-4_8.
Pełny tekst źródłaFranke, Jörg, Peter Wasserscheid, Thorsten Ihne, Peter Lamp, Jürgen Guldner i Oliver Zipse. "The Power of Technological Innovation". W Road to Net Zero, 215–64. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-42224-9_8.
Pełny tekst źródła"Children with Externalizing Behavior Problems". W The Power of Positive Parenting, redaktorzy Matthew R. Sanders, Trevor G. Mazzucchelli, Trevor G. Mazzucchelli i Matthew R. Sanders, 85–96. Oxford University Press, 2017. http://dx.doi.org/10.1093/med-psych/9780190629069.003.0006.
Pełny tekst źródłaGreenlaw, Raymond, H. James Hoover i Walter L. Ruzzo. "The Circuit Value Problem". W Limits to Parallel Computation. Oxford University Press, 1995. http://dx.doi.org/10.1093/oso/9780195085914.003.0010.
Pełny tekst źródłaSahoo, Prasanta, Supriyo Roy i J. Paulo Davim. "Design and Selection of Chemically Deposited Ni-P-W Coatings for Optimum Tribological Behavior". W Surface Engineering Techniques and Applications, 45–72. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-5141-8.ch002.
Pełny tekst źródłaNaifar, Fraj, Mariem Gzara i Taicir Loukil Moalla. "Scheduling in Flexible Manufacturing Systems". W Handbook of Research on Applied Optimization Methodologies in Manufacturing Systems, 1–19. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2944-6.ch001.
Pełny tekst źródłaTambouratzis, Tatiana, John Giannatsis, Andreas Kyriazis i Panayiotis Siotropos. "Applying the Computational Intelligence Paradigm to Nuclear Power Plant Operation". W Research Anthology on Artificial Intelligence Applications in Security, 1507–78. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-7705-9.ch068.
Pełny tekst źródłaStreszczenia konferencji na temat "Variantes du problème du p-Centre"
Silva, Jardell, Flavio Martins, Maria Silva i Sérgio Souza. "Algoritmo Genético Aplicado à Solução do Problema p-hub Centro Não Capacitado de Múltiplas Alocações". W Encontro Nacional de Inteligência Artificial e Computacional. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/eniac.2019.9340.
Pełny tekst źródłaCurdulino, Raucer, Pedro Yuri Araujo Lima Alves i Karina Valdivia Delgado. "Sistema para Resolver o Problema de Roteamento de Estoque Baseado em Técnicas de Monte Carlo". W XII Simpósio Brasileiro de Sistemas de Informação. Sociedade Brasileira de Computação, 2016. http://dx.doi.org/10.5753/sbsi.2016.5984.
Pełny tekst źródłaBalbino de Souza, Vinícius, i Lehilton Lelis Chaves Pedrosa. "Algoritmos de Aproximação para o Problema de Alocação de p-Terminais e Variantes". W XXV Congresso de Iniciação Cientifica da Unicamp. Campinas - SP, Brazil: Galoa, 2017. http://dx.doi.org/10.19146/pibic-2017-78671.
Pełny tekst źródłaSolov'eva, Anastasiya, Sergey Solov'ev, Leonid Shevcov i Valeriya Piven'. "ANALYSIS OF RELIABILITY OF FLAT TROUSERS BASED ON P-BLOCKS". W PROBLEMS OF APPLIED MECHANICS. Bryansk State Technical University, 2020. http://dx.doi.org/10.30987/conferencearticle_5fd1ed0352ef87.51750998.
Pełny tekst źródłaGurskaya, N. A., i K. V. Kobets. "THE RELATIONSHIP OF POLYMORPHIC VARIANTS OF ESTROGEN RECEPTOR GENES WITH THE DEVELOPMENT OF OSTEOPOROSIS IN THE BELARUSIAN POPULATION". W SAKHAROV READINGS 2021: ENVIRONMENTAL PROBLEMS OF THE XXI CENTURY. International Sakharov Environmental Institute, 2021. http://dx.doi.org/10.46646/sakh-2021-1-245-248.
Pełny tekst źródła"Dravet syndrome and Dravet-like phenotype: a systematic review of the SCN1A and PCDH19 variants". W XIII Congresso Paulista de Neurologia. Zeppelini Editorial e Comunicação, 2021. http://dx.doi.org/10.5327/1516-3180.229.
Pełny tekst źródłaGómez, Renzo. "Vertex-disjoint path covers in graphs". W II Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2017. http://dx.doi.org/10.5753/etc.2017.3205.
Pełny tekst źródłade Weerdt, Mathijs, Michael Albert, Vincent Conitzer i Koos van der Linden. "Complexity of Scheduling Charging in the Smart Grid". W Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/658.
Pełny tekst źródłaSuprovych, Tetiana, Mykola Suprovych, Vasyl Bandura, Ihor Chornyi i Yuliia Perehniak. "BoLA DRB3 gene's polymorphism of Ukrainian cattle breeds in relation to mastitis". W Scientific and practical conference with international participation: "Management of the genetic fund of animals – problems, solutions, outlooks". Scientific Practical Institute of Biotechnologies in Animal Husbandry and Veterinary Medicine, 2023. http://dx.doi.org/10.61562/mgfa2023.58.
Pełny tekst źródłaShrinidhi, M., T. K. Kaushik Jegannathan i R. Jeya. "Classification of Imbalanced Datasets Using Various Techniques along with Variants of SMOTE Oversampling and ANN". W International Research Conference on IOT, Cloud and Data Science. Switzerland: Trans Tech Publications Ltd, 2023. http://dx.doi.org/10.4028/p-338i7w.
Pełny tekst źródła