Добірка наукової літератури з теми "Stochastic matching models"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Stochastic matching models".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Stochastic matching models"
Dewilde, Patrick. "Stochastic models based on moment matching." Communications in Information and Systems 20, no. 2 (2020): 209–48. http://dx.doi.org/10.4310/cis.2020.v20.n2.a5.
Повний текст джерелаHu, Lin Y., and Sandra Jenni. "History Matching of Object-Based Stochastic Reservoir Models." SPE Journal 10, no. 03 (September 1, 2005): 312–23. http://dx.doi.org/10.2118/81503-pa.
Повний текст джерелаMairesse, Jean, and Pascal Moyal. "Editorial introduction to the special issue on stochastic matching models, matching queues and applications." Queueing Systems 96, no. 3-4 (December 2020): 357–58. http://dx.doi.org/10.1007/s11134-021-09690-2.
Повний текст джерелаComte, Céline. "Stochastic non-bipartite matching models and order-independent loss queues." Stochastic Models 38, no. 1 (October 10, 2021): 1–36. http://dx.doi.org/10.1080/15326349.2021.1962352.
Повний текст джерелаIwata, Tomoharu, Tsutomu Hirao, and Naonori Ueda. "Unsupervised Cluster Matching via Probabilistic Latent Variable Models." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (June 30, 2013): 445–51. http://dx.doi.org/10.1609/aaai.v27i1.8558.
Повний текст джерелаPankov, Vikentii, and Oleg Granichin. "SPSA Algorithm for Matching of Historical Data for Complex Non-Gaussian Geological Models." Cybernetics and Physics, Volume 11, 2022, Number 1 (June 2, 2022): 18–24. http://dx.doi.org/10.35470/2226-4116-2022-11-1-18-24.
Повний текст джерелаZhou, Deng Rong, Jian Chun Gong, and Fang Ling Fan. "A Stochastic Resonance Phenomenon in Linear Models." Applied Mechanics and Materials 401-403 (September 2013): 1301–4. http://dx.doi.org/10.4028/www.scientific.net/amm.401-403.1301.
Повний текст джерелаMeszáros, András, János Papp, and Miklós Telek. "Fitting traffic traces with discrete canonical phase type distributions and Markov arrival processes." International Journal of Applied Mathematics and Computer Science 24, no. 3 (September 1, 2014): 453–70. http://dx.doi.org/10.2478/amcs-2014-0034.
Повний текст джерелаTsioulou, Alexandra, Alexandros A. Taflanidis, and Carmine Galasso. "Modification of stochastic ground motion models for matching target intensity measures." Earthquake Engineering & Structural Dynamics 47, no. 1 (July 9, 2017): 3–24. http://dx.doi.org/10.1002/eqe.2933.
Повний текст джерелаBrignone, Riccardo, Ioannis Kyriakou, and Gianluca Fusai. "Moment-matching approximations for stochastic sums in non-Gaussian Ornstein–Uhlenbeck models." Insurance: Mathematics and Economics 96 (January 2021): 232–47. http://dx.doi.org/10.1016/j.insmatheco.2020.12.002.
Повний текст джерелаДисертації з теми "Stochastic matching models"
Tsao, Yu. "An ensemble speaker and speaking environment modeling approach to robust speech recognition." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26540.
Повний текст джерелаCommittee Chair: Lee, Chin-Hui; Committee Member: Anthony Joseph Yezzi; Committee Member: Biing-Hwang (Fred) Juang; Committee Member: Mark Clements; Committee Member: Ming Yuan. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Rahme, Youssef. "Stochastic matching model on the general graphical structures." Thesis, Compiègne, 2021. http://www.theses.fr/2021COMP2604.
Повний текст джерелаMotivated by a wide range of assemble-to-order systems and systems of the collaborativeeconomy applications, we introduce a stochastic matching model on hypergraphs and multigraphs, extending the model introduced by Mairesse and Moyal 2016. In this thesis, the stochastic matching model on general graph structures are defined as follows: given a compatibility general graph structure S = (V; S) which of a set of nodes denoted by V that represent the classes of items and by a set of edges denoted by S that allows matching between different classes of items. Items arrive at the system at a random time, by a sequence (assumed to be i:i:d:) that consists of different classes of V; and request to be matched due to their compatibility according to S: The compatibility by groups of two or more (hypergraphical cases) and by groups of two with possibilities of matching between the items of the same classes (multigraphical cases). The unmatched items are stored in the system and wait for a future compatible item and as soon as they are matched they leave it together. Upon arrival, an item may find several possible matches, the items that leave the system depend on a matching policy _ to be specified. We study the stability of the stochastic matching model on hypergraphs, for different hypergraphical topologies. Then, the stability of the stochastic matching model on multigraphs using the maximal subgraph and minimal blow-up to distinguish the zone of stability
Begeot, Jocelyn. "Autour de la stabilité de différents modèles d'appariements aléatoires." Electronic Thesis or Diss., Université de Lorraine, 2022. http://www.theses.fr/2022LORR0201.
Повний текст джерелаStochastic matching models represent many concrete stochastic systems in which elements of different classes are matched according to specified compatibility rules. For example, we can cite systems dedicated to organs allocation, job search sites, housing allocation programs, etc. Such models are typically associated to a triplet of elements: a connected graph, called compatibility graph, whose vertices represent the classes of elements that can enter the system and whose edges connect two compatible classes, amatching policy which decides the matches to be concretely executed, in case of multiple choices, and an arrival rate according to which the elements enter within it. In this thesis, we consider generalized graphs, meaning that we allow the matching of two elements of the same class, and we therefore extend to this framework some results already known in the case of simple graphs.The stability of a system governed by a matching model is a very important property. It ensures that the admissions within the system under study, are regulated, so that the elements do not accumulate in the system in the long run. It is therefore essential that the arrival rate of the elements allows the system to be stable. In this manuscript, we characterize, algebraically, this stability region for some matching models (general, general with reneging, bipartite, extended bipartite) or skill-based queueing systems.Moreover, we demonstrate that the matching policy called First Come, First Matched (FCFM) has the property of being (generalized) maximal, meaning that the stability region of the general matching model associated with a compatibility graph and with any policy is always included in the one associated with this same graph and ruled by FCFM. Note that this latter then coincides with a set of measures defined by purely algebraic conditions. In this case, the study of stability of the matching model at hand boils down to the more elementary question of characterizing of a deterministic set of measures. We then givea (simple) way to construct the measures belonging to the latter set. This turns out to be very useful for admission control, as checking the algebraic conditions requires a number of operations which is polynomial in the number of vertices of the considered compatibility graph, and therefore becomes very expensive as the number of vertices grows large.We also give, in a product form, the expression of the stationary distribution of the number-in-system process of a stable system governed by a general matching model and under the FCFM policy, allowing, in particular, to explicitly calculate characteristics at equilibrium of concrete systems and to estimate their long-time performance. We can thus, for example, calculate the size average at equilibrium of a waiting list in the case of cross-donation of kidneys, or even, estimate the average waiting time on a peer-to-peerinterface or on a dating website.Finally, the matching rates associated with a stable matching model (general or extended bipartite) are studied. They are defined as the asymptotic frequencies of the executed respective matchings, and provide an insightful performance criterion for the corresponding matching systems, as well as the policy-insensitivity and fairness properties of the matching rates, which are also discussed
Aliou, Diallo Aoudi Mohamed Habib. "Local matching algorithms on the configuration model." Electronic Thesis or Diss., Compiègne, 2023. http://www.theses.fr/2023COMP2742.
Повний текст джерелаThe 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
Fu, Jianlin. "A markov chain monte carlo method for inverse stochastic modeling and uncertainty assessment." Doctoral thesis, Universitat Politècnica de València, 2008. http://hdl.handle.net/10251/1969.
Повний текст джерелаFu, J. (2008). A markov chain monte carlo method for inverse stochastic modeling and uncertainty assessment [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/1969
Palancia
Maman, Waziri Khalid. "A stochastic earnings frontier approach to investigating labour market failures." Thesis, Aix-Marseille, 2018. http://www.theses.fr/2018AIXM0164/document.
Повний текст джерелаThis doctoral thesis addresses issues related to employees’ imperfect information on the labour market and discrimination, generally all direct consequences of labour underpayment or “earnings inefficiency”. Workers are in a situation of earnings inefficiency when they do not receive the full potential remuneration corresponding to their human capital endowment: unfair pay for greater stock of human capital. This situation is problematic from a policy-makers point of view as it could weaken work incentives, discourage investments in human capital, and harm economic growth and competitiveness. It could also widen inequality within the society and contribute to the increase in relative poverty.The contribution we make through this work is threefold. First, we examine the integration of young people into the labour market from a new angle. Instead of examining whether individuals obtain stable employment or not, we use an approach that focuses on the quality of the job matching for young people entering the workforce and lacking labour market information. This first chapter provides empirical evidence on job search theories. In a second chapter, because of the considerable challenge of identifying and assessing discriminatory practices in the labour market, we propose an innovative and effective approach to examine the phenomenon of the glass ceiling (an invisible barrier to management positions associated with higher earnings). Finally, the last part of this doctoral thesis is devoted to improving the econometric approach we use. We propose a theoretical econometric model that improves correction for sample selection bias with stochastic frontier models
Chang, Sheng-chieh, and 張聲傑. "A Carpool Matching Model and Solution Algorithms under Stochastic Travel Times." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/80065308173483617182.
Повний текст джерела國立中央大學
土木工程研究所
98
Respecting traffic volume has significantly grown and private cars become more popular than before in Taiwan. Therefore, carpool that enhances the car occupancy rate can not only relieve traffic congestion, but also reduce the travel cost which comes from the price of global petroleum going up, even save energy. As regards in Taiwan, carpool matching is manually performed by planning personnels with experience in current practice, without a systematic analysis. Such a manual approach is considered to be inefficient and ineffective. In other words, stochastic disturbances arising from variations in car travel times in actual operations are neglected. In the worst scenario, where car travel times fluctuate wildly during operations, the planned schedule could be disturbed enough to lose its optimality. Therefore, focusing on many-to-many origin-destination (OD), we constructed a stochastic carpool matching model that considers the influence of stochastic travel times. The matching model is expected to be an effective tool for the planner to solve carpool members matching. We employed network flow techniques to construct the stochastic carpool matching model, including multiple CVG (a carpool member group who can provide a vehicle) vehicle-flow networks, CVG passenger-flow networks and multiple CNG (a carpool member group who cannot provide any vehicle) passenger-flow networks to formulate the flows of CVGs and CNGs in the dimensions of time and space. Then, we modified the stochastic travel times in the stochastic carpool matching model as an average travel time to develop a deterministic scheduling model. The two models are formulated as special integer multiple commodity network flow problems, which are characterized as NP-hard. Since the problem sizes are expected to be huge in real practice, the models are difficult to be solved in a reasonable time. Therefore, we also developed a heuristic algorithm for efficiently solving matching problems. In addition, to evaluate the stochastic and deterministic carpool matching models, we also developed a simulation-based evaluation method. The performance of the solution method in practice is evaluated by carrying out a case study using real data and suitable assumptions, and then sensitive analysis is performed for different parameters. The test results show the model to be good and that the solution method could be useful in practice.
Wu, Yi-siang, and 吳逸祥. "An Integrated Model and Solution Algorithms for Taxipool and Passenger Matching Problems under Stochastic Travel Times." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/34047263389215135662.
Повний текст джерела國立中央大學
土木工程研究所
97
As the Taiwan urban areas’ traffic volume grew significantly, taxi becomes more popular than before in Taiwan. The low loading factor and use rate become an annoying problem, which should be resolved immediately. The taxipool plan can not only improve its operational performance, but can also relieve the traffic congestion problem. However, most taxi carriers currently use a trial-and-error process, in accordance with the projected taxi travel times, for taxipool matching, which is neither effective nor efficient. In other words, stochastic disturbances arising from variations in taxi travel times in actual operations are neglected. In the worst scenario, where taxi travel times fluctuate wildly during operations, the planned schedule could be disturbed enough to lose its optimality. Therefore, focusing on multiple origin-destination (OD) with advanced-order passenger trips, we constructed a stochastic taxipool matching model that considers the influence of stochastic travel times. The matching model is expected to be an effective tool for the planner to solve passenger matching and fleet scheduling. We employed network flow techniques to construct the stochastic taxipool matching model, including fleet-flow and passenger-flow networks. Then, we modified the stochastic travel times in the stochastic taxipool matching model as an average travel time to develop a deterministic scheduling model. The two models are formulated as special integer multiple commodity network flow problems, which are characterized as NP-hard. Since the problem sizes are expected to be huge in real practice, the models are difficult to be solved in a reasonable time. Therefore, we also developed a heuristic algorithm for efficiently solving passenger matching and fleet scheduling problems. In addition, to evaluate the stochastic and deterministic taxipool matching models, we also developed a simulation-based evaluation method. The performance of the solution method in practice is evaluated by carrying out a case study using real data and suitable assumptions, and then sensitive analysis is performed for different parameters. The test results show the model to be good and that the solution method could be useful in practice.
Частини книг з теми "Stochastic matching models"
Comte, Céline, and Jan-Pieter Dorsman. "Performance Evaluation of Stochastic Bipartite Matching Models." In Lecture Notes in Computer Science, 425–40. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-91825-5_26.
Повний текст джерелаBusic, A., and J. M. Fourneau. "Stochastic Matching Model with Returning Items." In Computer Performance Engineering and Stochastic Modelling, 186–200. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43185-2_13.
Повний текст джерелаNakamura, Naoto, Shigeru Takano, and Yoshihiro Okada. "3D Model Search Using Stochastic Attributed Relational Tree Matching." In Lecture Notes in Computer Science, 348–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17829-0_33.
Повний текст джерелаLiang, Xue, and Yujuan Wu. "Sensitivity Analysis and Stochastic History Matching of Shale Gas Production Based on Embedded Discrete Fracture Model." In Proceedings of the International Field Exploration and Development Conference 2018, 422–38. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-7127-1_39.
Повний текст джерелаGoeree, Jacob K., Charles A. Holt, and Thomas R. Palfrey. "Quantal Response Equilibrium in Normal-Form Games." In Quantal Response Equilibrium. Princeton University Press, 2016. http://dx.doi.org/10.23943/princeton/9780691124230.003.0002.
Повний текст джерелаТези доповідей конференцій з теми "Stochastic matching models"
Hu, Lin Y. "History Matching of Object-Based Stochastic Reservoir Models." In Middle East Oil Show. Society of Petroleum Engineers, 2003. http://dx.doi.org/10.2118/81503-ms.
Повний текст джерелаSchaaf, T., and B. Coureaud. "Joint Structural and Petrophysical History Matching of Stochastic Reservoir Models." In IOR 2009 - 15th European Symposium on Improved Oil Recovery. European Association of Geoscientists & Engineers, 2009. http://dx.doi.org/10.3997/2214-4609.201404830.
Повний текст джерелаStephen, K. D., and S. Arwini. "Improving Stochastic Inversion Methods in History Matching Using Proxy Models." In 12th European Conference on the Mathematics of Oil Recovery. Netherlands: EAGE Publications BV, 2010. http://dx.doi.org/10.3997/2214-4609.20145008.
Повний текст джерелаYang, Joonhyuk, and Hye Won Chung. "Graph Matching in Correlated Stochastic Block Models for Improved Graph Clustering." In 2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2023. http://dx.doi.org/10.1109/allerton58177.2023.10313461.
Повний текст джерелаSchaaf, Thomas, Bertrand Coureaud, and Francois Louis Labaune. "Joint Structural and Petrophysical History Matching Leads to Global Geological Stochastic Reservoir Models." In EUROPEC/EAGE Conference and Exhibition. Society of Petroleum Engineers, 2009. http://dx.doi.org/10.2118/121899-ms.
Повний текст джерелаJenni, Sandra, Lin Y. Hu, Remy Basquet, Ghislain de Marsily, and Bernard Bourbiaux. "History Matching of Stochastic Models of Field-Scale Fractures: Methodology and Case Study." In SPE Annual Technical Conference and Exhibition. Society of Petroleum Engineers, 2004. http://dx.doi.org/10.2118/90020-ms.
Повний текст джерелаEzra, Tomer, Michal Feldman, Nick Gravin, and Zhihao Gavin Tang. "Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models." In EC '20: The 21st ACM Conference on Economics and Computation. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3391403.3399513.
Повний текст джерелаHollenbeck, Derek, and YangQuan Chen. "Digital Twin Behavior Matching of Gas Plumes Using a Fixed Sensor Mesh and Dynamic Mode Decomposition." 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-70708.
Повний текст джерелаAl-Turki, Ali, Obai Alnajjar, Majdi Baddourah, and Babatunde Moriwawon. "Compressed Dimension of Reservoir Models Uncertainty Parameters for Optimized Model Calibration and History Matching Process." In SPE Annual Technical Conference and Exhibition. SPE, 2021. http://dx.doi.org/10.2118/206066-ms.
Повний текст джерелаAvalos, Javier, Lanae A. Richter, X. Q. Wang, Raghavendra Murthy, and Marc P. Mignolet. "Stochastic Modal Models of Slender Uncertain Curved Beams Preloaded Through Clamping." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-71169.
Повний текст джерелаЗвіти організацій з теми "Stochastic matching models"
Chen, Xin, Yanfeng Ouyang, Ebrahim Arian, Haolin Yang, and Xingyu Ba. Modeling and Testing Autonomous and Shared Multimodal Mobility Services for Low-Density Rural Areas. Illinois Center for Transportation, August 2022. http://dx.doi.org/10.36501/0197-9191/22-013.
Повний текст джерелаAliprantis, Dionissi, Daniel R. Carroll, and Eric R. Young. The Dynamics of the Racial Wealth Gap. Federal Reserve Bank of Cleveland, November 2022. http://dx.doi.org/10.26509/frbc-wp-201918r.
Повний текст джерелаFinkelstein-Shapiro, Alan, and Miguel Sarzosa. Unemployement Protection for Informal Workers in Latin America and the Caribbean. Inter-American Development Bank, September 2012. http://dx.doi.org/10.18235/0011470.
Повний текст джерела