Gotowa bibliografia na temat „Algorithme de flots”
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 „Algorithme de flots”.
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 "Algorithme de flots"
Parker, Michael J., Mark A. Lovich, Amy C. Tsao, Abraham E. Wei, Matthew G. Wakim, Mikhail Y. Maslov, Hisashi Tsukada i Robert A. Peterfreund. "Computer Control of Drug Delivery by Continuous Intravenous Infusion". Anesthesiology 122, nr 3 (1.03.2015): 647–58. http://dx.doi.org/10.1097/aln.0000000000000519.
Pełny tekst źródłaEkanayake, E. M. U. S. B., W. B. Daundasekara i S. P. C. Perera. "New Approach to Obtain the Maximum Flow in a Network and Optimal Solution for the Transportation Problems". Modern Applied Science 16, nr 1 (21.01.2022): 30. http://dx.doi.org/10.5539/mas.v16n1p30.
Pełny tekst źródłaWang, Yipu. "Max Flows in Planar Graphs with Vertex Capacities". ACM Transactions on Algorithms 18, nr 1 (31.01.2022): 1–27. http://dx.doi.org/10.1145/3504032.
Pełny tekst źródłaChen, Li, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg i Sushant Sachdeva. "Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow". Communications of the ACM 66, nr 12 (17.11.2023): 85–92. http://dx.doi.org/10.1145/3610940.
Pełny tekst źródłaAli, Gohar, Fernando Moreira, Omar Alfandi, Babar Shah i Mohammed Ilyas. "A New Intra-Cluster Scheduling Scheme for Real-Time Flows in Wireless Sensor Networks". Electronics 9, nr 4 (23.04.2020): 683. http://dx.doi.org/10.3390/electronics9040683.
Pełny tekst źródłaBt Ismail, Shafinaz, Darmawaty Bt Mohd Ali i Norsuzila Ya’acob. "Performance Analysis of Uplink Scheduling Algorithms in LTE Networks". Indonesian Journal of Electrical Engineering and Computer Science 9, nr 2 (1.02.2018): 373. http://dx.doi.org/10.11591/ijeecs.v9.i2.pp373-379.
Pełny tekst źródłaJoung, Jinoo, Yunki Choi i Sunghoon Son. "An improved algorithm for Detection of Elephant Flows". Journal of Korea Information and Communications Society 37B, nr 9 (30.09.2012): 849–58. http://dx.doi.org/10.7840/kics.2012.37b.9.849.
Pełny tekst źródłaBegouen Demeaux, Charlotte, i Emmanuel Boss. "Validation of Remote-Sensing Algorithms for Diffuse Attenuation of Downward Irradiance Using BGC-Argo Floats". Remote Sensing 14, nr 18 (9.09.2022): 4500. http://dx.doi.org/10.3390/rs14184500.
Pełny tekst źródłaWu, Tian-Yu, Jianfei Zhang, Yanjun Dai, Tao-Feng Cao, Kong Ling i Wen-Quan Tao. "Implementation of IDEAL algorithm based on Delaunay triangular mesh for 2D-compressible flows". Engineering Computations 41, nr 3 (7.05.2024): 630–54. http://dx.doi.org/10.1108/ec-02-2023-0071.
Pełny tekst źródłaTsekeris, Theodore, i Antony Stathopoulos. "Real-Time Dynamic Origin-Destination Matrix Adjustment with Simulated and Actual Link Flows in Urban Networks". Transportation Research Record: Journal of the Transportation Research Board 1857, nr 1 (styczeń 2003): 117–27. http://dx.doi.org/10.3141/1857-14.
Pełny tekst źródłaRozprawy doktorskie na temat "Algorithme de flots"
Gueth, Frederic. "Observations interférométriques des flots moléculaires L1157 et HH211". Université Joseph Fourier (Grenoble), 1997. http://www.theses.fr/1997GRE10202.
Pełny tekst źródłaVernet, Mathilde. "Modèles et algorithmes pour les graphes dynamiques". Thesis, Normandie, 2020. http://www.theses.fr/2020NORMLH12.
Pełny tekst źródłaGraph problems have been widely studied in the case of static graphs. However, these graphs do not allow a time dimension to be considered, even though time is an important variable for the situations to model. Dynamic graphs make it possible to model evolution over time. This is a reason to wonder about graph problems in a dynamic context. First, it is necessary to define the most appropriate dynamic graphs model and the precise problem on those graphs. When the problem cannot be efficiently solved directly using known static graph methods, an algorithm specific to dynamic graphs must be designed and analyzed theoretically and practically.With that approach, this thesis' objective is to study graph problems' extensions to dynamic graphs. This works deals with several graph problems in a dynamic context by focusing on algorithmic aspects and without considering application domains
Bouchakour, Mustapha. "Composition de graphes et le polytope des absorbantsUn algorithme de coupes pour le problème du flots a coûts fixes". Rennes 1, 1996. http://www.theses.fr/1996REN10196.
Pełny tekst źródłaBeker, Sergio Ariel. "Techniques d'Optimisation pour le Dimensionnement et la Reconfiguration des Réseaux MPLS". Phd thesis, Télécom ParisTech, 2004. http://pastel.archives-ouvertes.fr/pastel-00000689.
Pełny tekst źródłaBonnotte, Nicolas. "Unidimensional and Evolution Methods for Optimal Transportation". Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00946781.
Pełny tekst źródłaSa, Shibasaki Rui. "Lagrangian Decomposition Methods for Large-Scale Fixed-Charge Capacitated Multicommodity Network Design Problem". Thesis, Université Clermont Auvergne (2017-2020), 2020. http://www.theses.fr/2020CLFAC024.
Pełny tekst źródłaTypically present in logistics and telecommunications domains, the Fixed-Charge Multicommodity Capacitated Network Design Problem remains challenging, especially when large-scale contexts are involved. In this particular case, the ability to produce good quality soutions in a reasonable amount of time leans on the availability of efficient algorithms. In that sense, the present thesis proposed Lagrangian approaches that are able to provide relatively sharp bounds for large-scale instances of the problem. The efficiency of the methods depend on the algorithm applied to solve Lagrangian duals, so we choose between two of the most efficient solvers in the literature: the Volume Algorithm and the Bundle Method, providing a comparison between them. The results showed that the Volume Algorithm is more efficient in the present context, being the one kept for further research.A first Lagrangian heuristic was devised to produce good quality feasible solutions for the problem, obtaining far better results than Cplex, for the largests instances. Concerning lower bounds, a Relax-and-Cut algorithm was implemented embbeding sensitivity analysis and constraint scaling, which improved results. The increases in lower bounds attained 11\%, but on average they remained under 1\%.The Relax-and-Cut algorithm was then included in a Branch-and-Cut scheme, to solve linear programs in each node of the search tree. Moreover, a Feasibility Pump heuristic using the Volume Algorithm as solver for linear programs was implemented to accelerate the search for good feasible solutions in large-scale cases. The obtained results showed that the proposed scheme is competitive with the best algorithms in the literature, and provides the best results in large-scale contexts. Moreover, a heuristic version of the Branch-and-Cut algorithm based on the Lagrangian Feasibility Pump was tested, providing the best results in general, when compared to efficient heuristics in the literature
Soyez-Martin, Claire. "From semigroup theory to vectorization : recognizing regular languages". Electronic Thesis or Diss., Université de Lille (2022-....), 2023. http://www.theses.fr/2023ULILB052.
Pełny tekst źródłaThe pursuit of optimizing regular expression validation has been a long-standing challenge,spanning several decades. Over time, substantial progress has been made through a vast range of approaches, spanning from ingenious new algorithms to intricate low-level optimizations.Cutting-edge tools have harnessed these optimization techniques to continually push the boundaries of efficient execution. One notable advancement is the integration of vectorization, a method that leverage low-level parallelism to process data in batches, resulting in significant performance enhancements. While there has been extensive research on designing handmade tailored algorithms for particular languages, these solutions often lack generalizability, as the underlying methodology cannot be applied indiscriminately to any regular expression, which makes it difficult to integrate to existing tools.This thesis provides a theoretical framework in which it is possible to generate vectorized programs for regular expressions corresponding to rational expressions in a given class. To do so, we rely on the algebraic theory of automata, which provides tools to process letters in parallel. These tools also allow for a deeper understanding of the underlying regular language, which gives access to some properties that are useful when producing vectorized algorithms. The contribution of this thesis is twofold. First, it provides implementations and preliminary benchmarks to study the potential efficiency of algorithms using algebra and vectorization. Second, it gives algorithms that construct vectorized programs for languages in specific classes of rational expressions, namely the first order logic and its subset restricted to two variables
Frery, Jordan. "Ensemble Learning for Extremely Imbalced Data Flows". Thesis, Lyon, 2019. http://www.theses.fr/2019LYSES034.
Pełny tekst źródłaMachine learning is the study of designing algorithms that learn from trainingdata to achieve a specific task. The resulting model is then used to predict overnew (unseen) data points without any outside help. This data can be of manyforms such as images (matrix of pixels), signals (sounds,...), transactions (age,amount, merchant,...), logs (time, alerts, ...). Datasets may be defined to addressa specific task such as object recognition, voice identification, anomaly detection,etc. In these tasks, the knowledge of the expected outputs encourages a supervisedlearning approach where every single observed data is assigned to a label thatdefines what the model predictions should be. For example, in object recognition,an image could be associated with the label "car" which suggests that the learningalgorithm has to learn that a car is contained in this picture, somewhere. This is incontrast with unsupervised learning where the task at hand does not have explicitlabels. For example, one popular topic in unsupervised learning is to discoverunderlying structures contained in visual data (images) such as geometric formsof objects, lines, depth, before learning a specific task. This kind of learning isobviously much harder as there might be potentially an infinite number of conceptsto grasp in the data. In this thesis, we focus on a specific scenario of thesupervised learning setting: 1) the label of interest is under represented (e.g.anomalies) and 2) the dataset increases with time as we receive data from real-lifeevents (e.g. credit card transactions). In fact, these settings are very common inthe industrial domain in which this thesis takes place
Gessese, Alelign Fekade. "Algorithms for Bed Topography Reconstruction in Geophysical Flows". Thesis, University of Canterbury. Mechanical Engineering, 2013. http://hdl.handle.net/10092/8673.
Pełny tekst źródłaPervaiz, Mehtab M. "Spatio-temporal adaptive algorithm for reacting flows". Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/34994.
Pełny tekst źródłaKsiążki na temat "Algorithme de flots"
L, Magnanti Thomas, i Orlin James B. 1953-, red. Network flows: Theory, algorithms, and applications. Englewood Cliffs, N.J: Prentice Hall, 1993.
Znajdź pełny tekst źródłaTidriri, M. D. Schwarz-based algorithms for compressible flows. Hampton, Va: Institute for Computer Applications in Science and Engineering, 1996.
Znajdź pełny tekst źródłaL, Magnanti Thomas, i Orlin James B, red. Network flows: Theory, algorithms, and applications. Englewood Cliffs, NJ: Prentice Hall, 1993.
Znajdź pełny tekst źródła1955-, Bloch Anthony, red. Hamiltonian and gradient flows, algorithms, and control. Providence, RI: American Mathematical Society, 1994.
Znajdź pełny tekst źródłaRuhe, Günther. Algorithmic Aspects of Flows in Networks. Dordrecht: Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-011-3444-6.
Pełny tekst źródłaRuhe, Günther. Algorithmic aspects of flows in networks. Dordrecht: Kluwer Academic Publishers, 1991.
Znajdź pełny tekst źródłaUnited States. National Aeronautics and Space Administration., red. An algorithm for unsteady flows with strong convection. [Washington, DC]: National Aeronautics and Space Administration, 1988.
Znajdź pełny tekst źródłaAn Euler solution algorithm for steady helicopter-rotor flows. [Downsview, Ont.]: University of Toronto, Graduate Department of Aerospace Science and Engineering, 1994.
Znajdź pełny tekst źródłaOden, J. Tinsley. Vectorizable algorithms for adaptive schemes for rapid analysis of SSME flows: Final report. Austin, Tex: Computational Mechanics Co., Inc., 1987.
Znajdź pełny tekst źródłaB, Gatski T., i Langley Research Center, red. Efficient parallel algorithm for direct numerical simulation of turbulent flows. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1997.
Znajdź pełny tekst źródłaCzęści książek na temat "Algorithme de flots"
Jungnickel, Dieter. "Flows". W Graphs, Networks and Algorithms, 155–208. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-662-03822-2_6.
Pełny tekst źródłaJungnickel, Dieter. "Flows". W Graphs, Networks and Algorithms, 163–218. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-32278-5_6.
Pełny tekst źródłaKorte, Bernhard, i Jens Vygen. "Network Flows". W Algorithms and Combinatorics, 173–209. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24488-9_8.
Pełny tekst źródłaKorte, Bernhard, i Jens Vygen. "Network Flows". W Algorithms and Combinatorics, 153–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-662-21708-5_8.
Pełny tekst źródłaKorte, Bernhard, i Jens Vygen. "Network Flows". W Algorithms and Combinatorics, 153–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-662-21711-5_8.
Pełny tekst źródłaKorte, Bernhard, i Jens Vygen. "Network Flows". W Algorithms and Combinatorics, 177–214. Berlin, Heidelberg: Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-662-56039-6_8.
Pełny tekst źródłaHetland, Magnus Lie. "Matchings, Cuts, and Flows". W Python Algorithms, 209–25. Berkeley, CA: Apress, 2014. http://dx.doi.org/10.1007/978-1-4842-0055-1_10.
Pełny tekst źródłaKorte, Bernhard, i Jens Vygen. "Minimum Cost Flows". W Algorithms and Combinatorics, 211–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24488-9_9.
Pełny tekst źródłaKao, Ming-Yang. "Atomic Selfish Flows". W Encyclopedia of Algorithms, 77. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_42.
Pełny tekst źródłaKorte, Bernhard, i Jens Vygen. "Minimum Cost Flows". W Algorithms and Combinatorics, 185–204. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-662-21708-5_9.
Pełny tekst źródłaStreszczenia konferencji na temat "Algorithme de flots"
Benke, M., E. Shapiro i D. Drikakis. "FALCO: Fast Linear Corrector for Modelling DNA-Laden Flows". W ASME 2008 6th International Conference on Nanochannels, Microchannels, and Minichannels. ASMEDC, 2008. http://dx.doi.org/10.1115/icnmm2008-62131.
Pełny tekst źródłaLikhachov, Alexey V., i Valery V. Pickalov. "Three-Dimensional Tomography of Thermal Flows for Limited Angle of View". W ASME 1998 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/imece1998-0774.
Pełny tekst źródłaFeist, Sofia, Bruno Ferreira i António Leitao. "Collaborative Algorithmic-based Building Information Modelling". W CAADRIA 2017: Protocols, Flows, and Glitches. CAADRIA, 2017. http://dx.doi.org/10.52842/conf.caadria.2017.613.
Pełny tekst źródłaJanssen, Patrick. "Evolutionary Urbanism - Exploring Form-based Codes Using Neuroevolution Algorithms". W CAADRIA 2017: Protocols, Flows, and Glitches. CAADRIA, 2017. http://dx.doi.org/10.52842/conf.caadria.2017.303.
Pełny tekst źródłaMa, Yidong, i Weiguo Xu. "Physarealm - A Bio-inspired Stigmergic Algorithm Tool for Form-Finding". W CAADRIA 2017: Protocols, Flows, and Glitches. CAADRIA, 2017. http://dx.doi.org/10.52842/conf.caadria.2017.499.
Pełny tekst źródłaMa, Yidong, i Weiguo Xu. "Physarealm - A Bio-inspired Stigmergic Algorithm Tool for Form-Finding". W CAADRIA 2017: Protocols, Flows, and Glitches. CAADRIA, 2017. http://dx.doi.org/10.52842/conf.caadria.2017.499.
Pełny tekst źródłaRajesh, A., H. S. Ko i Ken D. Kihm. "Hybrid Approach to Tomographic Reconstruction of Bubbles in Two-Phase Flows Using Genetic Algorithm". W ASME 1998 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/imece1998-0770.
Pełny tekst źródłaKamali, R., i S. A. Shekoohi. "Two Algorithms for Solving Coupled Particle Dynamics and Flow Field Equations in Two-Phase Flows". W ASME 2010 8th International Conference on Nanochannels, Microchannels, and Minichannels collocated with 3rd Joint US-European Fluids Engineering Summer Meeting. ASMEDC, 2010. http://dx.doi.org/10.1115/fedsm-icnmm2010-30443.
Pełny tekst źródłaSou, Akira, Kosuke Hayashi i Tsuyoshi Nakajima. "Evaluation of Volume Tracking Algorithms for Gas-Liquid Two-Phase Flows". W ASME/JSME 2003 4th Joint Fluids Summer Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/fedsm2003-45164.
Pełny tekst źródłaChun, Sejong, i Hyu-Sang Kwon. "Use of Wigner-Ville Transformations for Fluid Particles in Laser Doppler Flow Accelerometry". W ASME-JSME-KSME 2011 Joint Fluids Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/ajk2011-16021.
Pełny tekst źródłaRaporty organizacyjne na temat "Algorithme de flots"
Andrade, Jose E. Energy-Consistent Multiscale Algorithms for Granular Flows. Fort Belvoir, VA: Defense Technical Information Center, sierpień 2014. http://dx.doi.org/10.21236/ada610189.
Pełny tekst źródłaRobert Nourgaliev i Mark Christon. Solution Algorithms for Effective-Field Models of Multi-Fluid Flows. Office of Scientific and Technical Information (OSTI), wrzesień 2012. http://dx.doi.org/10.2172/1058095.
Pełny tekst źródłaKularatne, Dhanushka N., Subhrajit Bhattacharya i M. Ani Hsieh. Computing Energy Optimal Paths in Time-Varying Flows. Drexel University, 2016. http://dx.doi.org/10.17918/d8b66v.
Pełny tekst źródłaWilson, T. L., B. D. Nichols, C. W. Hirt i L. R. Stein. SOLA-DM: A numerical solution algorithm for transient three-dimensional flows. Office of Scientific and Technical Information (OSTI), luty 1988. http://dx.doi.org/10.2172/5228335.
Pełny tekst źródłaMontiel, Peter J. Capital Flows: Issues and Policies. Inter-American Development Bank, maj 2013. http://dx.doi.org/10.18235/0011498.
Pełny tekst źródłaJacobs, Gustaaf B. High-Order Particle-Mesh Algorithms for Computation of Particle-Laden Shocked Flows. Fort Belvoir, VA: Defense Technical Information Center, maj 2012. http://dx.doi.org/10.21236/ada567598.
Pełny tekst źródłaChung, T. J. Flowfield-Dependent Mixed Explicit-Implicit(FDMEI) Algorithm Toward Direct Numerical Simulation in High Speed Flows. Fort Belvoir, VA: Defense Technical Information Center, lipiec 1997. http://dx.doi.org/10.21236/ada329549.
Pełny tekst źródłaWilliams, P. T. CCM Continuity Constraint Method: A finite-element computational fluid dynamics algorithm for incompressible Navier-Stokes fluid flows. Office of Scientific and Technical Information (OSTI), wrzesień 1993. http://dx.doi.org/10.2172/10194809.
Pełny tekst źródłaAyoul-Guilmard, Q., F. Nobile, S. Ganesh, M. Nuñez, R. Tosi, C. Soriano i R. Rosi. D5.5 Report on the application of multi-level Monte Carlo to wind engineering. Scipedia, 2022. http://dx.doi.org/10.23967/exaqute.2022.3.03.
Pełny tekst źródłaLohner, Rainald, i Jean Cabello. Development and Application of New Algorithms for the Simulation of Compressible flows with Moving Bodies in Three Dimensions. Fort Belvoir, VA: Defense Technical Information Center, marzec 1992. http://dx.doi.org/10.21236/ada250232.
Pełny tekst źródła