Literatura científica selecionada sobre o tema "Algorithmes de mariage"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Algorithmes de mariage".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Algorithmes de mariage"
Bacci, M. Livi, e Gustavo De Santis. "Population reproduction. A method of breakdown and estimation (Population, 5,1997)". Population Vol. 53, HS2 (2 de dezembro de 1998): 245–66. http://dx.doi.org/10.3917/popu.p1998.10n2.0266.
Texto completo da fonteLivi Bacci, Massimo, e Gustavo De Santis. "La reproduction des populations : une méthode de décomposition et d'estimation". Population Vol. 52, n.º 5 (1 de maio de 1997): 1119–42. http://dx.doi.org/10.3917/popu.p1997.52n5.1142.
Texto completo da fonteNewton, P. F. "Algorithmic versions of black spruce stand density management diagrams". Forestry Chronicle 73, n.º 2 (1 de abril de 1997): 257–65. http://dx.doi.org/10.5558/tfc73257-2.
Texto completo da fonteZhou Yingfeng, 周迎峰, 张荣芬 Zhang Rongfen, 刘宇红 Liu Yuhong e 李宽 Li Kuan. "基于RetinaNet的海洋鱼类检测算法". Laser & Optoelectronics Progress 60, n.º 10 (2023): 1010014. http://dx.doi.org/10.3788/lop213356.
Texto completo da fonteÖztürk, Nurcan, e Hasan Tahsin Öztürk. "DENİZE DEŞARJ YAPILARININ ÖĞRETME VE ÖĞRENME TABANLI ALGORITMAYLA OPTİMUM TASARIMI". E-Journal of New World Sciences Academy 13, n.º 3 (30 de julho de 2018): 235–42. http://dx.doi.org/10.12739/nwsa.2018.13.3.2a0153.
Texto completo da fonteNguyen, Vi H., e Duc T. Nguyen. "Marine Quay Crane Scheduling Using a Combined Modified Genetic Algorithm and Priority Rules Approach". International Journal of Materials, Mechanics and Manufacturing 7, n.º 1 (fevereiro de 2019): 21–26. http://dx.doi.org/10.18178/ijmmm.2019.7.1.422.
Texto completo da fonteNewton, Peter F. "Regional-Specific Algorithmic Stand Density Management Diagram for Black Spruce". Northern Journal of Applied Forestry 15, n.º 2 (1 de junho de 1998): 94–97. http://dx.doi.org/10.1093/njaf/15.2.94.
Texto completo da fonteLemenkova, Polina. "R Libraries {dendextend} and {magrittr} and Clustering Package scipy.cluster of Python For Modelling Diagrams of Dendrogram Trees". Carpathian Journal of Electronic and Computer Engineering 13, n.º 3 (1 de setembro de 2020): 5–12. http://dx.doi.org/10.2478/cjece-2020-0002.
Texto completo da fonteYu, Lisan. "Global Air–Sea Fluxes of Heat, Fresh Water, and Momentum: Energy Budget Closure and Unanswered Questions". Annual Review of Marine Science 11, n.º 1 (3 de janeiro de 2019): 227–48. http://dx.doi.org/10.1146/annurev-marine-010816-060704.
Texto completo da fontePalma, Sindika Alifia, e Sandy Kosasi. "PENERAPAN FRAMEWORK CODEIGNITER UNTUK WEBSITE TOKO ONLINE PADA DASTER HITS PONTIANAK". Jurnal Informatika Progres 15, n.º 1 (3 de maio de 2023): 13–22. http://dx.doi.org/10.56708/progres.v15i1.343.
Texto completo da fonteTeses / dissertações sobre o assunto "Algorithmes de mariage"
Aliou, Diallo Aoudi Mohamed Habib. "Local matching algorithms on the configuration model". Electronic Thesis or Diss., Compiègne, 2023. http://www.theses.fr/2023COMP2742.
Texto completo da fonteThe present thesis constructs an alternative framework to online matching algorithms on large graphs. Using the configuration model to mimic the degree distributions of large networks, we are able to build algorithms based on local matching policies for nodes. Thus, we are allowed to predict and approximate the performances of a class of matching policies given the degree distributions of the initial network. Towards this goal, we use a generalization of the differential equation method to measure valued processes. Through-out the text, we provide simulations and a comparison to the seminal work of Karp, Vazirani and Vazirani based on the prevailing viewpoint in online bipartite matching
Laveau, Marie. "Asynchronous Self-Stabilizing Stable Marriage". Electronic Thesis or Diss., université Paris-Saclay, 2020. http://www.theses.fr/2020UPASG008.
Texto completo da fonteThe Stable Marriage Problem (SMP) is a matching problem where participants have preferences over their potential partners.The objective is to find a matching that is optimal (stable in certain sens) with regard to these preferences.This type of matching has a lot of widely used applications such as the assignment of children to schools, interns to hospitals, kidney transplant patients to donors, as well as taxi scheduling or content delivery on the Internet.Some applications can be solved in a centralized way while others, due to their distributed nature and their complex data, need a different treatment.For example, when applying this problem to the Cloud-Computing context, virtual machines are emulated by real machines located all over the world.A centralized algorithm would cause unbearable delays and be sensible to failures, which is inconceivable for a service meant to be available at any time.On the other hand, when humans are to be matched or involved in a matching, they have the right to keep their personal data private and in particular their list of preferences.Consequently, the preference lists should not be transmitted on the Internet, and even less gathered for a centralized treatment.This is why, distribution, fault-tolerance (by self-stabilization) and privacy are the three main keywords of this thesis.In order to handle these challenges, we provide two distributed self-stabilizing solutions.Such solutions tolerate transient (or short-lived) failures (e.g., memory or message corruptions) of any nodes.The privacy of the preference lists is guaranteed by the two proposed algorithms: lists are not shared, only some binary queries and responses are transmitted.One of the differences between the two algorithms is the communication model: the first algorithm uses the state model while the second algorithm uses the more general register model.In both models, executions proceed in atomic steps and a daemon (distributed unfair daemon) conveys the notion of asynchrony.Under this daemon, the stabilization time can be bounded in term of moves (local computations).This complexity metrics allows to evaluate the necessary computational power or the energy consumption of the algorithm's executions.This is not the case when the stabilization time is measured in rounds since an unbounded number of moves may be executed during a round.The first algorithm, based on the centralized method of Ackermann et al. (SICOMP' 2011), solves the problem in O(n⁴) moves.It also solves some variants of SMP such as the Stable Marriage with indifference, with unacceptable partners, etc.The starting point of the second algorithm is the local detection/global correction scheme of Awerbuch et al. (DA' 1994): a non-self-stabilizing algorithm (with initialization) that satisfies the property of local checkability can be combined with a detector and a reset algorithms.The result of this composition is a self-stabilizing version of the given algorithm.Unfortunately, local checkability definition of DA '1994 does not apply to our case (in particular due to the unfair daemon).Consequently, we propose a new definition.Furthermore, we design a distributed self-stabilizing asynchronous reset algorithm. Using it, the resulting composed algorithm solves SMP in θ(n)² moves in a self-stabilizing way
Mariano, Artur [Verfasser], Christian [Akademischer Betreuer] Bischof e Pingali [Akademischer Betreuer] Keshav. "High performance algorithms for lattice-based cryptanalysis / Artur Mariano ; Christian Bischof, Pingali Keshav". Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2016. http://d-nb.info/112001459X/34.
Texto completo da fontePark, Jinhyung. "Pipe-routing algorithm development for a ship engine room design". Thesis, online access from Digital Dissertation Consortium access full-text, 2002. http://libweb.cityu.edu.hk/cgi-bin/er/db/ddcdiss.pl?3062999.
Texto completo da fonteHoward, James A. E. "Application of the sequential t-test algorithm for analysing regime shifts to the southern Benguela ecosystem". Master's thesis, University of Cape Town, 2007. http://hdl.handle.net/11427/6481.
Texto completo da fonteIncludes abstract.
Long-term ecosystem changes, such as regime shifts, have occurred in several marine ecosystems worldwide. Multivariate statistical methods have been used to detect such changes, but they have to date not been applied to the southern Benguela ecosystem. A weakness of many of the methods is that they require long time series data and do not provide robust results at the end of time series. A new method known as the sequential t-test algorithm for analysing regime shifts (STARS) is applied to a set of biological state variables and environmental and anthropogenic forcing variables in the southern Benguela.
Maneepan, Komsan. "Genetic algorithm based optimisation of FRP composite plates in ship structures". Thesis, University of Southampton, 2007. https://eprints.soton.ac.uk/52012/.
Texto completo da fonteYE, Zi. "Traitement statistique de l'information et du signal pour l'internet des objets sous-marins". Thesis, Institut polytechnique de Paris, 2021. https://tel.archives-ouvertes.fr/tel-03179373.
Texto completo da fonteThere has been recently a large development of human activities associated to the ocean world, where no standard has emerged for the Internet of Things (IoT) linked to marine autonomous objects. Though it has a limited bandwidth, the acoustic wave is the only way to communicate over average to large distances and it is thus used by many underwater systems to communicate, navigate, or infer information about the environment. This led to a high demand for wireless networks that require both spectral efficiency and energy efficiency with the associated low-complexity algorithms. Therefore, in this Ph.D. thesis, we proposed several original solutions to face this challenge.Indeed, due to the inherent Signal Space Diversity (SSD), rotated constellations allow better theoretical performance than conventional constellations with no spectral spoilage. We review the structural properties of uniformly projected rotated M-QAM constellations, so as to propose a low complexity soft demapping technique for fading channels. Then, we present an original blind technique for the reduction of the PAPR for OFDM systems using the rotated constellations with SSD. In order to reduce the complexity of blind decoding for this technique, we again rely on the properties of uniformly projected M-QAM rotated constellations to design a low-complexity estimator. Moreover, to face the selectivity of the acoustic channel, we suggest a sparse adaptive turbo detector with only a few taps to be updated in order to lower down the complexity burden. Finally, we have proposed an original self-optimized algorithm for which the step-sizes of both the equalizer and the phase estimator are updated adaptively and assisted by soft-information in an iterative manner, so as to meet the requirement of fast convergence and low MSE over time-varying channels
Vega, Emanuel Pablo. "Conception orientée-tâche et optimisation de systèmes de propulsion reconfigurables pour robots sous-marins autonomes". Thesis, Brest, 2016. http://www.theses.fr/2016BRES0067/document.
Texto completo da fonteIn this PhD thesis, the optimization of the propulsion and control of AUVs is developed. The hydrodynamic model of the AUVs is examined. Additionally, AUV propulsion topologies are studied and models for fixed and vectorial technology are developed. The fixed technology model is based on an off the shelf device, while the modeled vectorial propulsive system is based on a magnetic coupling thruster prototype developed in IRDL (Institut de Recherche Dupuy de Lôme) at ENI Brest. A control method using the hydrodynamic model is studied, its adaptation to two AUV topologies is presented and considerations about its applicability will be discussed. The optimization is used to find suitable propulsive topologies and control parameters in order to execute given robotic tasks, speeding up the convergence and minimizing the energy consumption. This is done using a genetic algorithm, which is a stochastic optimization method used for task-based design.The results of the optimization can be used as a preliminary stage in the design process of an AUV, giving ideas for enhanced propulsive configurations. The optimization technique is also applied to an IRDL existing robot, modifying only some of the propulsive topology parameters in order to readily adapt it to different tasks, making the AUV dynamically reconfigurable
Gallego, Bonet Guillermo. "Variational image processing algorithms for the stereoscopic space-time reconstruction of water waves". Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39480.
Texto completo da fonteNagarajan, Nishatha. "Target Tracking Via Marine Radar". University of Toledo / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1345125374.
Texto completo da fonteLivros sobre o assunto "Algorithmes de mariage"
Knuth, Donald Ervin. Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms. Providence, R.I: American Mathematical Society, 1997.
Encontre o texto completo da fonteKaandorp, Jaap A. The Algorithmic Beauty of Seaweeds, Sponges and Corals. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001.
Encontre o texto completo da fonteWalsh, William J. Carrier optimization launch algorithm: An optimization model to maximize the number of tactically tasked sorties under constraint restriction. Monterey, Calif: Naval Postgraduate School, 1991.
Encontre o texto completo da fonteLevitin, Anany, e Maria Levitin. Algorithmic Puzzles. Oxford University Press, 2011. http://dx.doi.org/10.1093/oso/9780199740444.001.0001.
Texto completo da fonteThe Algorithmic Beauty of Seaweeds, Sponges and Corals. Springer, 2001.
Encontre o texto completo da fonteMarghany, Maged. Automatic Detection Algorithms of Oil Spill in Radar Images. Taylor & Francis Group, 2021.
Encontre o texto completo da fonteMarghany, Maged. Automatic Detection Algorithms of Oil Spill in Radar Images. Taylor & Francis Group, 2019.
Encontre o texto completo da fonteAutomatic Detection Algorithms of Oil Spill in Radar Images. Taylor & Francis Group, 2019.
Encontre o texto completo da fonteMarghany, Maged. Automatic Detection Algorithms of Oil Spill in Radar Images. Taylor & Francis Group, 2019.
Encontre o texto completo da fonteO'Kane, Mike. Web-Based Introduction to Programming: Essential Algorithms, Syntax, and Control Structures Using PHP, HTML, and MariaDB/MySQL. Carolina Academic Press, 2017.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Algorithmes de mariage"
Ahmad, Imran, e Athapol Noomhorm. "Glycans predictive modeling using modern algorithms". In Marine Glycobiology, 415–22. Taylor & Francis Group, 6000 Broken Sound Parkway NW, Suite 300, Boca Raton, FL 33487-2742: CRC Press, 2016. http://dx.doi.org/10.1201/9781315371399-31.
Texto completo da fonteBorstad, Gary A., Edward J. Carpenter e Jim F. R. Gower. "Development of Algorithms for Remote Sensing of Trichodesmium Blooms". In Marine Pelagic Cyanobacteria: Trichodesmium and other Diazotrophs, 193–210. Dordrecht: Springer Netherlands, 1992. http://dx.doi.org/10.1007/978-94-015-7977-3_12.
Texto completo da fonteNicolas, Florian, Andreas Arnold-Bos, Isabelle Quidu e Benoît Zerr. "Fast Fourier-Based Block-Matching Algorithm for Sonar Tracks Registration in a Multiresolution Framework". In Marine Robotics and Applications, 1–14. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70724-2_1.
Texto completo da fonteShi, Yang, Chao Shen, Henglai Wei e Kunwu Zhang. "Efficient Implementation Algorithms for NMPC-Based AUV Trajectory-Tracking Control". In Advanced Model Predictive Control for Autonomous Marine Vehicles, 145–79. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-19354-5_8.
Texto completo da fonteNicolas, Florian, Andreas Arnold-Bos, Isabelle Quidu e Benoît Zerr. "Erratum to: Fast Fourier-Based Block-Matching Algorithm for Sonar Tracks Registration in a Multiresolution Framework". In Marine Robotics and Applications, E1. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70724-2_10.
Texto completo da fonteGong, In-Young, Yeon-Gyu Kim, Chang-Min Lee, Jin-Whan Kim e Han-Jin Lee. "Development of harbor capability assessment simulation system by the application of fuzzy algorithm". In Marine Simulation and Ship Manoeuvrability, 161–67. London: Routledge, 2021. http://dx.doi.org/10.1201/9780203748077-20.
Texto completo da fonteKuperman, W. A., M. D. Collins e H. Schmidt. "A Fast Simulated Annealing Algorithm for the Inversion of Marine Sediment Seismo-Acoustic Parameters". In Shear Waves in Marine Sediments, 521–28. Dordrecht: Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-011-3568-9_60.
Texto completo da fonteChen, Yuhan, Wengang Mao e Chi Zhang. "Different strategies to improve isochrone voyage optimization algorithm". In Advances in the Analysis and Design of Marine Structures, 53–61. London: CRC Press, 2023. http://dx.doi.org/10.1201/9781003399759-6.
Texto completo da fonteWu, Wei, Chunshui Xiong, Xuan Guo e Dongming Zhao. "Improved particle swarm optimization and DDQN algorithm for multi-UUV path planning". In Sustainable Development and Innovations in Marine Technologies, 343–50. London: CRC Press, 2022. http://dx.doi.org/10.1201/9781003358961-43.
Texto completo da fonteCai, Y., e J. Jelovica. "Comparison of metaheuristic algorithms and constraint handling approaches for multi-objective optimization of a tanker". In Advances in the Analysis and Design of Marine Structures, 801–8. London: CRC Press, 2023. http://dx.doi.org/10.1201/9781003399759-88.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Algorithmes de mariage"
Ates, Abdullah, e YangQuan Chen. "Fractional Order Filter Discretization With Marine Predators Algorithm". In ASME 2021 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/detc2021-67611.
Texto completo da fonteConey, William B. "A Procedure for the Comparative Evaluation and Preliminary Design of Marine Propulsors". In SNAME 6th Propeller and Shafting Symposium. SNAME, 1991. http://dx.doi.org/10.5957/pss-1991-07.
Texto completo da fonteYubai, Zhang, Li Qiong e Tan Shuliang. "Study on Marine Information Model Under Marine Ecological Technology of Computer Cloud Computing". In 2024 IEEE 3rd International Conference on Electrical Engineering, Big Data and Algorithms (EEBDA). IEEE, 2024. http://dx.doi.org/10.1109/eebda60612.2024.10485981.
Texto completo da fonteSMAOUI, H., C. FLEURY e L. SCHMIT. "Advances in dual algorithms and convex approximation methods". In Advanced Marine Systems Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1988. http://dx.doi.org/10.2514/6.1988-2382.
Texto completo da fonteHarper, Thurman R., Jeffrey E. Greenblatt e Andrew J. Mazzeo. "Unattended System for Recording Machinery Transients and for Validation of Trending Algorithms". In Marine Propulsion Technology. 400 Commonwealth Drive, Warrendale, PA, United States: SAE International, 1986. http://dx.doi.org/10.4271/860876.
Texto completo da fonteKooij, Carmen, Sietske de Geus-Moussault e Herbert Koelman. "Innovative Maritime Design Education at NHL Stenden University of Applied Sciences". In SNAME 14th International Marine Design Conference. SNAME, 2022. http://dx.doi.org/10.5957/imdc-2022-260.
Texto completo da fonteRuiz-Capel, S., P. Romero-Tello, J. Gutiérrez-Romero, A. Reyes e D. Kraniotis. "Seakeeping optimization of bulbous bow vessels through genetic algorithms". In 10th Conference on Computational Methods in Marine Engineering. CIMNE, 2023. http://dx.doi.org/10.23967/marine.2023.005.
Texto completo da fonteXue, Jirai, Weiping Ouyang, Yannan Du e Huiqing Ouyang. "Simulation Study on Dynamic Characteristic of Marine Elevator". In 2018 International Conference on Mathematics, Modelling, Simulation and Algorithms (MMSA 2018). Paris, France: Atlantis Press, 2018. http://dx.doi.org/10.2991/mmsa-18.2018.26.
Texto completo da fonteTaheri, Ramin, e Karim Mazaheri. "Blade Shape Optimization of Marine Propeller via Genetic Algorithm for Efficiency Improvement". In ASME Turbo Expo 2012: Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/gt2012-68183.
Texto completo da fonteCao, Xiaojuan, e Yongquan Yang. "Research on Chinese Named Entity Recognition in the Marine Field". In ACAI 2018: 2018 International Conference on Algorithms, Computing and Artificial Intelligence. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3302425.3302500.
Texto completo da fonteRelatórios de organizações sobre o assunto "Algorithmes de mariage"
Kularatne, Dhanushka N., Subhrajit Bhattacharya e M. Ani Hsieh. Computing Energy Optimal Paths in Time-Varying Flows. Drexel University, 2016. http://dx.doi.org/10.17918/d8b66v.
Texto completo da fonteRémy, Elisabeth, Romain Escudier e Alexandre Mignot. Access impact of observations. EuroSea, 2023. http://dx.doi.org/10.3289/eurosea_d4.8.
Texto completo da fonte