Log in

Relevant bibliographies by topics / Optimal matching

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Optimal matching'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Optimal matching.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Optimal matching"

1

Mazón, José Manuel, Julio Daniel Rossi, and Julián Toledo. "On optimal matching measures for matching problems related to the Euclidean distance." Mathematica Bohemica 139, no. 4 (2014): 553–66. http://dx.doi.org/10.21136/mb.2014.144132.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

CHENG, EDDIE, and SACHIN PADMANABHAN. "MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES." Parallel Processing Letters 22, no. 02 (May 16, 2012): 1250005. http://dx.doi.org/10.1142/s0129626412500053.

Full text

Abstract:

The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. In this paper, we find the matching preclusion number and the conditional matching preclusion number with the classification of the optimal sets for the class of crossed cubes, an important variant of the class of hypercubes. Indeed, we will establish more general results on the matching preclusion and the conditional matching preclusion problems for a larger class of interconnection networks.

APA, Harvard, Vancouver, ISO, and other styles

3

Cabra, Luís M. B. "Optimal matching auctions." Economics Letters 37, no. 1 (September 1991): 7–9. http://dx.doi.org/10.1016/0165-1765(91)90234-c.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Baccara, Mariagiovanna, SangMok Lee, and Leeat Yariv. "Optimal dynamic matching." Theoretical Economics 15, no. 3 (2020): 1221–78. http://dx.doi.org/10.3982/te3740.

Full text

Abstract:

We study a dynamic matching environment where individuals arrive sequentially. There is a trade‐off between waiting for a thicker market, allowing for higher‐quality matches, and minimizing agents' waiting costs. The optimal mechanism cumulates a stock of incongruent pairs up to a threshold and matches all others in an assortative fashion instantaneously. In discretionary settings, a similar protocol ensues in equilibrium, but expected queues are inefficiently long. We quantify the welfare gain from centralization, which can be substantial, even for low waiting costs. We also evaluate welfare improvements generated by alternative priority protocols.

APA, Harvard, Vancouver, ISO, and other styles

5

CHENG, EDDIE, RANDY JIA, and DAVID LU. "MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES." Journal of Interconnection Networks 11, no. 01n02 (March 2010): 35–60. http://dx.doi.org/10.1142/s0219265910002726.

Full text

Abstract:

The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those incident to a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those incident to a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. In this paper, we find this number and classify all optimal sets for the augmented cubes, a class of networks designed as an improvement of the hypercubes.

APA, Harvard, Vancouver, ISO, and other styles

6

Ekeland, Ivar. "An optimal matching problem." ESAIM: Control, Optimisation and Calculus of Variations 11, no. 1 (December 15, 2004): 57–71. http://dx.doi.org/10.1051/cocv:2004034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Michalis, Constantine, Nicholas E. Scott-Samuel, David P. Gibson, and Innes C. Cuthill. "Optimal background matching camouflage." Proceedings of the Royal Society B: Biological Sciences 284, no. 1858 (July 12, 2017): 20170709. http://dx.doi.org/10.1098/rspb.2017.0709.

Full text

Abstract:

Background matching is the most familiar and widespread camouflage strategy: avoiding detection by having a similar colour and pattern to the background. Optimizing background matching is straightforward in a homogeneous environment, or when the habitat has very distinct sub-types and there is divergent selection leading to polymorphism. However, most backgrounds have continuous variation in colour and texture, so what is the best solution? Not all samples of the background are likely to be equally inconspicuous, and laboratory experiments on birds and humans support this view. Theory suggests that the most probable background sample (in the statistical sense), at the size of the prey, would, on average, be the most cryptic. We present an analysis, based on realistic assumptions about low-level vision, that estimates the distribution of background colours and visual textures, and predicts the best camouflage. We present data from a field experiment that tests and supports our predictions, using artificial moth-like targets under bird predation. Additionally, we present analogous data for humans, under tightly controlled viewing conditions, searching for targets on a computer screen. These data show that, in the absence of predator learning, the best single camouflage pattern for heterogeneous backgrounds is the most probable sample.

APA, Harvard, Vancouver, ISO, and other styles

8

Hollister, Matissa. "Is Optimal Matching Suboptimal?" Sociological Methods & Research 38, no. 2 (November 2009): 235–64. http://dx.doi.org/10.1177/0049124109346164.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ramachandran, T., and K. Velusamy. "Optimal Matching Using SMA." Journal of Information and Optimization Sciences 35, no. 4 (July 4, 2014): 359–72. http://dx.doi.org/10.1080/02522667.2014.926705.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Didier, Gilles. "Optimal pattern matching algorithms." Journal of Complexity 51 (April 2019): 79–109. http://dx.doi.org/10.1016/j.jco.2018.10.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Optimal matching"

1

Abrahamson, Jeff Shokoufandeh Ali. "Optimal matching and deterministic sampling /." Philadelphia, Pa. : Drexel University, 2007. http://hdl.handle.net/1860/2526.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Moser, Hannes. "Finding optimal solutions for covering and matching problems." Göttingen Cuvillier, 2009. http://d-nb.info/999819399/04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kwanashie, Augustine. "Efficient algorithms for optimal matching problems under preferences." Thesis, University of Glasgow, 2015. http://theses.gla.ac.uk/6706/.

Full text

Abstract:

In this thesis we consider efficient algorithms for matching problems involving preferences, i.e., problems where agents may be required to list other agents that they find acceptable in order of preference. In particular we mainly study the Stable Marriage problem (SM), the Hospitals / Residents problem (HR) and the Student / Project Allocation problem (SPA), and some of their variants. In some of these problems the aim is to find a stable matching which is one that admits no blocking pair. A blocking pair with respect to a matching is a pair of agents that prefer to be matched to each other than their assigned partners in the matching if any. We present an Integer Programming (IP) model for the Hospitals / Residents problem with Ties (HRT) and use it to find a maximum cardinality stable matching. We also present results from an empirical evaluation of our model which show it to be scalable with respect to real-world HRT instance sizes. Motivated by the observation that not all blocking pairs that exist in theory will lead to a matching being undermined in practice, we investigate a relaxed stability criterion called social stability where only pairs of agents with a social relationship have the ability to undermine a matching. This stability concept is studied in instances of the Stable Marriage problem with Incomplete lists (smi) and in instances of hr. We show that, in the smi and hr contexts, socially stable matchings can be of varying sizes and the problem of finding a maximum socially stable matching (max smiss and max hrss respectively) is NP-hard though approximable within 3/2. Furthermore we give polynomial time algorithms for three special cases of the problem arising from restrictions on the social network graph and the lengths of agents’ preference lists. We also consider other optimality criteria with respect to social stability and establish inapproximability bounds for the problems of finding an egalitarian, minimum regret and sex equal socially stable matching in the sm context. We extend our study of social stability by considering other variants and restrictions of max smiss and max hrss. We present NP-hardness results for max smiss even under certain restrictions on the degree and structure of the social network graph as well as the presence of master lists. Other NP-hardness results presented relate to the problem of determining whether a given man-woman pair belongs to a socially stable matching and the problem of determining whether a given man (or woman) is part of at least one socially stable matching. We also consider the Stable Roommates problem with Incomplete lists under Social Stability (a non-bipartite generalisation of smi under social stability). We observe that the problem of finding a maximum socially stable matching in this context is also NP-hard. We present efficient algorithms for three special cases of the problem arising from restrictions on the social network graph and the lengths of agents’ preference lists. These are the cases where (i) there exists a constant number of acquainted pairs (ii) or a constant number of unacquainted pairs or (iii) each preference list is of length at most 2. We also present algorithmic results for finding matchings in the spa context that are optimal with respect to profile, which is the vector whose ith component is the number of students assigned to their ith-choice project. We present an efficient algorithm for finding a greedy maximum matching in the spa context — this is a maximum matching whose profile is lexicographically maximum. We then show how to adapt this algorithm to find a generous maximum matching — this is a matching whose reverse profile is lexicographically minimum. We demonstrate how this approach can allow additional constraints, such as lecturer lower quotas, to be handled flexibly. We also present results of empirical evaluations carried out on both real world and randomly generated datasets. These results demonstrate the scalability of our algorithms as well as some interesting properties of these profile-based optimality criteria. Practical applications of spa motivate the investigation of certain special cases of the problem. For instance, it is often desired that the workload on lecturers is evenly distributed (i.e. load balanced). We enforce this by either adding lower quota constraints on the lecturers (which leads to the potential for infeasible problem instances) or adding a load balancing optimisation criterion. We present efficient algorithms in both cases. Another consideration is the fact that certain projects may require a minimum number of students to become viable. This can be handled by enforcing lower quota constraints on the projects (which also leads to the possibility of infeasible problem instances). A technique of handling this infeasibility is the idea of closing projects that do not meet their lower quotas (i.e. leaving such project completely unassigned). We show that the problem of finding a maximum matching subject to project lower quotas where projects can be closed is NP-hard even under severe restrictions on preference lists lengths and project upper and lower quotas. To offset this hardness, we present polynomial time heuristics that find large feasible matchings in practice. We also present ip models for the spa variants discussed and show results obtained from an empirical evaluation carried out on both real and randomly generated datasets. These results show that our algorithms and heuristics are scalable and provide good matchings with respect to profile-based optimality.

APA, Harvard, Vancouver, ISO, and other styles

4

Singh, Rohit Ph D. Massachusetts Institute of Technology. "Automatically learning optimal formula simplifiers and database entity matching rules." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113938.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 153-161).
Traditionally, machine learning (ML) is used to find a function from data to optimize a numerical score. On the other hand, synthesis is traditionally used to find a function (or a program) that can be derived from a grammar and satisfies a logical specification. The boundary between ML and synthesis has been blurred by some recent work [56,90]. However, this interaction between ML and synthesis has not been fully explored. In this thesis, we focus on the problem of finding a function given large amounts of data such that the function satisfies a logical specification and also optimizes a numerical score over the input data. We present a framework to solve this problem in two impactful application domains: formula simplification in constraint solvers and database entity matching (EM). First, we present a system called Swapper based on our framework that can automatically generate code for efficient formula simplifiers specialized to a class of problems. Formula simplification is an important part of modern constraint solvers, and writing efficient simplifiers has largely been an arduous manual task. Evaluation of Swapper on multiple applications of the Sketch constraint solver showed 15-60% improvement over the existing hand-crafted simplifier in Sketch. Second, we present a system called EM-Synth based on our framework that generates as effective and more interpretable EM rules than the state-of-the-art techniques. Database entity matching is a critical part of data integration and cleaning, and it usually involves learning rules or classifiers from labeled examples. Evaluation of EM-Synth on multiple real-world datasets against other interpretable (shallow decision trees, SIFI [116]) and noninterpretable (SVM, deep decision trees) methods showed that EM-Synth generates more concise and interpretable rules without sacrificing too much accuracy.
by Rohit Singh.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

5

Chen, Hanyi. "Probabilistic matching systems : stability, fluid and diffusion approximations and optimal control." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/10570.

Full text

Abstract:

In this work we introduce a novel queueing model with two classes of users in which, instead of accessing a resource, users wait in the system to match with a candidate from the other class. The users are selective and the matchings occur probabilistically. This new model is useful for analysing the traffic in web portals that match people who provide a service with people who demand the same service, e.g. employment portals, matrimonial and dating sites and rental portals. We first provide a Markov chain model for these systems and derive the probability distribution of the number of matches up to some finite time given the number of arrivals. We then prove that if no control mechanism is employed these systems are unstable for any set of parameters. We suggest four different classes of control policies to assure stability and conduct analysis on performance measures under the control policies. Contrary to the intuition that the rejection rate should decrease as the users become more likely to be matched, we show that for certain control policies the rejection rate is insensitive to the matching probability. Even more surprisingly, we show that for reasonable policies the rejection rate may be an increasing function of the matching probability. We also prove insensitivity results related to the average queue lengths and waiting times. Further, to gain more insight into the behaviour of probabilistic matching systems, we propose approximation methods based on fluid and diffusion limits using different scalings. We analyse the basic properties of these approximations and show that some performance measures are insensitive to the matching probability agreeing with the results found by the exact analysis. Finally we study the optimal control and revenue management for the systems with the objective of profit maximization. We formulate mathematical models for both unobservable and observable systems. For an unobservable system we suggest a deterministic optimal control, while for an observable system we develop an optimal myopic state dependent pricing.

APA, Harvard, Vancouver, ISO, and other styles

6

Kumar, Deepak. "Optimal finite alphabet sources over partial response channels." Thesis, Texas A&M University, 2003. http://hdl.handle.net/1969.1/1044.

Full text

Abstract:

We present a serially concatenated coding scheme for partial response channels. The encoder consists of an outer irregular LDPC code and an inner matched spectrum trellis code. These codes are shown to offer considerable improvement over the i.i.d. capacity (> 1 dB) of the channel for low rates (approximately 0.1 bits per channel use). We also present a qualitative argument on the optimality of these codes for low rates. We also formulate a performance index for such codes to predict their performance for low rates. The results have been verified via simulations for the (1-D)/sqrt(2) and the (1-D+0.8D^2)/sqrt(2.64) channels. The structure of the encoding/decoding scheme is considerably simpler than the existing scheme to maximize the information rate of encoders over partial response channels.

APA, Harvard, Vancouver, ISO, and other styles

7

Burnham, Katherine Lee. "Information fusion for an unmanned underwater vehicle through probabilistic prediction and optimal matching." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/127297.

Full text

Abstract:

Thesis: S.M., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, May, 2020
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 89-92).
This thesis presents a method for information fusion for an unmanned underwater vehicle (UUV).We consider a system that fuses contact reports from automated information system (AIS) data and active and passive sonar sensors. A linear assignment problem with learned assignment costs is solved to fuse sonar and AIS data. Since the sensors operate effectively at different depths, there is a time lag between AIS and sonar data collection. A recurrent neural network predicts a contact's future occupancy grid from a segment of its AIS track. Assignment costs are formed by comparing a sonar position with the predicted occupancy grids of relevant vessels. The assignment problem is solved to determine which sonar reports to match with existing AIS contacts.
by Katherine Lee Burnham.
S.M.
S.M. Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center

APA, Harvard, Vancouver, ISO, and other styles

8

Akers, Allen. "Determination of the Optimal Number of Strata for Bias Reduction in Propensity Score Matching." Thesis, University of North Texas, 2010. https://digital.library.unt.edu/ark:/67531/metadc28380/.

Full text

Abstract:

Previous research implementing stratification on the propensity score has generally relied on using five strata, based on prior theoretical groundwork and minimal empirical evidence as to the suitability of quintiles to adequately reduce bias in all cases and across all sample sizes. This study investigates bias reduction across varying number of strata and sample sizes via a large-scale simulation to determine the adequacy of quintiles for bias reduction under all conditions. Sample sizes ranged from 100 to 50,000 and strata from 3 to 20. Both the percentage of bias reduction and the standardized selection bias were examined. The results show that while the particular covariates in the simulation met certain criteria with five strata that greater bias reduction could be achieved by increasing the number of strata, especially with larger sample sizes. Simulation code written in R is included.

APA, Harvard, Vancouver, ISO, and other styles

9

Salter, James Martin. "Uncertainty quantification for spatial field data using expensive computer models : refocussed Bayesian calibration with optimal projection." Thesis, University of Exeter, 2017. http://hdl.handle.net/10871/30114.

Full text

Abstract:

In this thesis, we present novel methodology for emulating and calibrating computer models with high-dimensional output. Computer models for complex physical systems, such as climate, are typically expensive and time-consuming to run. Due to this inability to run computer models efficiently, statistical models ('emulators') are used as fast approximations of the computer model, fitted based on a small number of runs of the expensive model, allowing more of the input parameter space to be explored. Common choices for emulators are regressions and Gaussian processes. The input parameters of the computer model that lead to output most consistent with the observations of the real-world system are generally unknown, hence computer models require careful tuning. Bayesian calibration and history matching are two methods that can be combined with emulators to search for the best input parameter setting of the computer model (calibration), or remove regions of parameter space unlikely to give output consistent with the observations, if the computer model were to be run at these settings (history matching). When calibrating computer models, it has been argued that fitting regression emulators is sufficient, due to the large, sparsely-sampled input space. We examine this for a range of examples with different features and input dimensions, and find that fitting a correlated residual term in the emulator is beneficial, in terms of more accurately removing regions of the input space, and identifying parameter settings that give output consistent with the observations. We demonstrate and advocate for multi-wave history matching followed by calibration for tuning. In order to emulate computer models with large spatial output, projection onto a low-dimensional basis is commonly used. The standard accepted method for selecting a basis is to use n runs of the computer model to compute principal components via the singular value decomposition (the SVD basis), with the coefficients given by this projection emulated. We show that when the n runs used to define the basis do not contain important patterns found in the real-world observations of the spatial field, linear combinations of the SVD basis vectors will not generally be able to represent these observations. Therefore, the results of a calibration exercise are meaningless, as we converge to incorrect parameter settings, likely assigning zero posterior probability to the correct region of input space. We show that the inadequacy of the SVD basis is very common and present in every climate model field we looked at. We develop a method for combining important patterns from the observations with signal from the model runs, developing a calibration-optimal rotation of the SVD basis that allows a search of the output space for fields consistent with the observations. We illustrate this method by performing two iterations of history matching on a climate model, CanAM4. We develop a method for beginning to assess model discrepancy for climate models, where modellers would first like to see whether the model can achieve certain accuracy, before allowing specific model structural errors to be accounted for. We show that calibrating using the basis coefficients often leads to poor results, with fields consistent with the observations ruled out in history matching. We develop a method for adjusting for basis projection when history matching, so that an efficient and more accurate implausibility bound can be derived that is consistent with history matching using the computationally prohibitive spatial field.

APA, Harvard, Vancouver, ISO, and other styles

10

Araujo, Bruno César Pino Oliveira de. "Trajetórias ocupacionais de engenheiros jovens no Brasil." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/3/3136/tde-23062016-153336/.

Full text

Abstract:

Esta tese analisa 9.041 trajetórias ocupacionais de jovens engenheiros como empregados formais no Brasil entre 2003-2012, a partir da técnica de Optimal Matching Analysis (OMA). Estas trajetórias foram comparadas às de uma geração anterior de jovens engenheiros, tanto em seu período-base (1995-2002) como entre 2003-2012, a fim de identificar efeitos de idade e período. Os principais resultados são: (i) conforme esperado, trajetórias ocupacionais ligadas à gestão (em áreas correlatas à engenharia ou não) são as que oferecem remuneração mais alta em todos os períodos analisados; (ii) nos anos 2000, o terceiro padrão mais atrativo para os jovens daquela geração foi permanecer como engenheiro típico, caminho perseguido por praticamente metade deles, enquanto tal atratividade não foi verificada nos anos 1990; (iii) o salário de entrada dos jovens engenheiros subiu 24% em termos reais entre 1995 e 2003; (iv) há pouca mobilidade de trajetória ocupacional por parte da geração dos engenheiros de 1995 após 2003; (v) os jovens engenheiros de 1995 que permaneceram como engenheiros típicos durante os anos 2000 chegaram a 2012 ganhando apenas 14% a mais do que os jovens engenheiros de 2003 (com 8 anos a menos de experiência); para comparação, os gestores da geração 90 ganhavam em torno de 50% a mais do que os da geração 2000; (vi) há dois momentos de definição de trajetória ocupacional: um primeiro ocorre até 3 anos após o primeiro emprego, mas promoções a cargos de gestão podem ocorrer entre 8 e 10 anos. Estes resultados indicam que, se por um lado houve uma revalorização dos profissionais de engenharia na última década, por outro lado esta revalorização não trouxe engenheiros anteriormente formados a carreiras típicas em engenharia. Isto, aliado à baixa demanda pelos cursos de engenharia durante os anos 80 e 90, corrobora a hipótese de um hiato geracional entre os engenheiros, documentado em artigos anteriores.
This PhD dissertation analyzes 9,041 occupational trajectories of young engineers as formal employees in Brazil in 2003-2012, using Optimal Matching Analysis (OMA). These trajectories were compared to those of a previous generation of young engineers, both in its base period (1995-2002) and in 2003-2012, to identify age and period effects. The main results are: (i) as expected, management occupational trajectories (in areas related to engineering or not) pay higher wages, in all periods; (ii) in the 2000s, the third most attractive trajectory was to remain as typical engineer, path pursued by nearly half of young engineers, however, this was not verified in the 1990s; (iii) entry wages of young engineers rose 24% in real terms between 1995 and 2003; (iv) there is little occupational mobility by the generation of 1995 engineers after 2003; (v) young engineers of 1995 who remained as typical engineers during the 2000s earned only 14% more in 2012 than young engineers of 2003; for comparison, in 2012 managers from the 90s earned about 50% more those from the 2000s; (vi) there are two defining moments of occupational trajectory: a first occurs until three years after the first job, but promotions to management positions can take place between 8 and 10 years. These results indicate that, on the one hand, there was a revaluation of engineers over the past decade; on the other hand, this did not attracted former bachelors back to typical careers in Engineering. This, combined with low demand for engineering courses during the 80s and 90s, supports the hypothesis of a generational gap among engineers, documented in previous articles.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Optimal matching"

1

Aisenbrey, Silke. Optimal Matching Analyse. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Thomas, Carlos. Search and matching functions and optimal monetary policy. London: Centre for Economic Performance, London School of Economics and Political Science, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Katzman, Brett. Optimal monetary impulse-response functions in a matching model. Cambridge, MA: National Bureau of Economic Research, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Katzman, Brett. Optimal monetary impulse-response functions in a matching model. [Minneapolis, Minn.]: Federal Reserve Bank of Minneapolis, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Halpin, Brendan. Class careers as sequences: An optimal matching analysis of work-life histories. Colchester: ESRC Research Centre on Micro-social Change, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Essays on Discrete Optimization: Optimal Stopping and Popular Matchings. [New York, N.Y.?]: [publisher not identified], 2022.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Dawson, K. M. Implicit model matching as an approach to three-dimensional object recognition. Dublin: Trinity College, Department of Computer Science, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Gloster, Lawrence Anthony William. Optical parametric oscillators: Noncollinear phase matching and linewidth studies in beta barium borate. Manchester: University of Manchester, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Li, Yanjun. Jing xiang pi pei yu mu biao shi bie ji shu. Xi an: Xi bei gong ye ta xue chu ban she, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

I, Watson C., Paek Eung Gi, and National Institute of Standards and Technology (U.S.), eds. Effect of resolution and image quality on combined optical and neural network fingerprint matching. Gaithersburg, MD: U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Optimal matching"

1

Aisenbrey, Silke. "Vorbemerkung." In Optimal Matching Analyse, 11–12. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Aisenbrey, Silke. "Einleitung." In Optimal Matching Analyse, 13–18. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Aisenbrey, Silke. "Optimal Matching Analyse: Das Vorgehen." In Optimal Matching Analyse, 19–31. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Aisenbrey, Silke. "Forschungsstand: Die Optimal Matching Analyse in den Sozialwissenschaften." In Optimal Matching Analyse, 32–54. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Aisenbrey, Silke. "Optimal Matching Analyse: Ein Anwendungsbeispiel." In Optimal Matching Analyse, 55–109. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Aisenbrey, Silke. "Die Optimal Matching Analyse und andere Verfahren zur Analyse von zeitbezogenen Daten." In Optimal Matching Analyse, 110–18. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Aisenbrey, Silke. "Ist der Weg das Ziel? — Ein Ausblick." In Optimal Matching Analyse, 119–22. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Aisenbrey, Silke. "Anhang: Tabellen und Erläuterungen." In Optimal Matching Analyse, 123–27. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Aisenbrey, Silke. "Literaturverzeichnis." In Optimal Matching Analyse, 128–31. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Greevy, Robert A., and Bo Lu. "Optimal Nonbipartite Matching." In Handbook of Matching and Weighting Adjustments for Causal Inference, 227–38. Boca Raton: Chapman and Hall/CRC, 2023. http://dx.doi.org/10.1201/9781003102670-12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Optimal matching"

1

Fleischer, R., and Yihui Wang. "Dynamic Pareto Optimal Matching." In 2008 International Symposium on Information Science and Engineering (ISISE). IEEE, 2008. http://dx.doi.org/10.1109/isise.2008.237.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Di Garbo, C., P. Livreri, and G. Vitale. "Optimal matching between optical rectennas and harvester circuits." In 2017 IEEE International Conference on Environment and Electrical Engineering and 2017 IEEE Industrial and Commercial Power Systems Europe (EEEIC / I&CPS Europe). IEEE, 2017. http://dx.doi.org/10.1109/eeeic.2017.7977686.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Long, Cheng, Raymond Chi-Wing Wong, Philip S. Yu, and Minhao Jiang. "On optimal worst-case matching." In the 2013 international conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2463676.2465321.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Costa, Mauro, Robert Haralick, Tsaiyun Phillips, and Linda Shapiro. "Optimal Affine-Invariant Point Matching." In SPIE 1989 Technical Symposium on Aerospace Sensing, edited by Mohan M. Trivedi. SPIE, 1989. http://dx.doi.org/10.1117/12.969300.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Paryanti, Gil, Dan Sadot, and Vladymir Lyandres. "Optimal Source Matching in Optical Code Division Multiple Access." In 2006 IEEE International Conference on Communications. IEEE, 2006. http://dx.doi.org/10.1109/icc.2006.255176.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Arenz, Oleg, Hany Abdulsamad, and Gerhard Neumann. "Optimal control and inverse optimal control by distribution matching." In 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2016. http://dx.doi.org/10.1109/iros.2016.7759596.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Dalvi, Nilesh, Vibhor Rastogi, Anirban Dasgupta, Anish Das Sarma, and Tamas Sarlos. "Optimal hashing schemes for entity matching." In the 22nd international conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2488388.2488415.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bissell, Robert. "Calculating Optimal Parameters for History Matching." In ECMOR IV - 4th European Conference on the Mathematics of Oil Recovery. European Association of Geoscientists & Engineers, 1994. http://dx.doi.org/10.3997/2214-4609.201411181.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Costa, Mauro S., Robert M. Haralick, and Linda G. Shapiro. "Optimal affine-invariant matching: performance characterization." In SPIE/IS&T 1992 Symposium on Electronic Imaging: Science and Technology, edited by Albert A. Jamberdino and Carlton W. Niblack. SPIE, 1992. http://dx.doi.org/10.1117/12.58489.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Roumy, A., and D. Gesbert. "Optimal matching in wireless sensor networks." In 2007 IEEE International Symposium on Information Theory. IEEE, 2007. http://dx.doi.org/10.1109/isit.2007.4557533.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Optimal matching"

1

Mavris, Dimitri N., and Russell K. Denney. Optimal Robust Matching of Engine Models to Test Data. Fort Belvoir, VA: Defense Technical Information Center, February 2009. http://dx.doi.org/10.21236/ada498300.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Katzman, Brett, John Kennan, and Neil Wallace. Optimal Monetary Impulse-Response Functions in a Matching Model. Cambridge, MA: National Bureau of Economic Research, November 1999. http://dx.doi.org/10.3386/w7425.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Balduzzi, Pierluigi, and Jonathan Reuter. Heterogeneity in Target-Date Funds: Optimal Risk-Taking or Risk Matching? Cambridge, MA: National Bureau of Economic Research, March 2012. http://dx.doi.org/10.3386/w17886.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lazarov, R. D., J. E. Pasciak, J. Schoberl, and P. S. Vassilevski. Almost Optimal Interior Penalty Discontinuous Approximations of Symmetric Elliptic Problems on Non-Matching Grids. Office of Scientific and Technical Information (OSTI), August 2001. http://dx.doi.org/10.2172/15006515.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wilson, Charles L., Craig I. Watson, and Eung Gi Paek. Combined optical and neural network fingerprint matching. Gaithersburg, MD: National Institute of Standards and Technology, 1997. http://dx.doi.org/10.6028/nist.ir.5955.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Salamo, Gregory J. Advanced Nonlinear Optical Materials Using Quasi-Phase Matching. Fort Belvoir, VA: Defense Technical Information Center, May 1998. http://dx.doi.org/10.21236/ada358157.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Little, James J., and Alessandro Verri. Analysis of Differential and Matching Methods for Optical Flow. Fort Belvoir, VA: Defense Technical Information Center, August 1988. http://dx.doi.org/10.21236/ada234424.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Romero Molina, Paola Ximena. Teaching Lesson Planning to EFL Preservice Teachers: A Review of Studies. Institucion Universitaria Colombo Americana, 2022. http://dx.doi.org/10.26817/paper.19.

Full text

Abstract:

Preparing English as a Foreign Language (EFL) preservice teachers for lesson planning has a been a concern among teacher educators globally. Research has shown that preservice teachers encounter difficulties in aspects such as objective setting, considering their learners’ needs, and matching assessment and objectives, among others. Similarly, preservice teachers still need to be presented with ample opportunities for reflective teaching. These concerns have been addressed by teacher educators in systematic ways. Hence, guided by two sets of research questions, this literature review aims at exploring the procedures that educators in diverse contexts have used to aid their student teachers in preparing for lesson planning. The first set seeks to identify the procedures used as well as their outcomes. The second set of questions aims to inquire on the methodologies adopted. Twelve studies were selected for the final review, which were found using the Educational Resources Information Center (ERIC) and Google scholar databases as well as the academia.edu platform. A matrix was created to analyze the papers selected together with a coding process. The analysis revealed that collaborative procedures such as mentoring and lesson study combined with reflective teaching seem to render optimal learning experiences for preservice teachers. A special mention is given to plan lessons using authentic materials. Furthermore, types of methodologies that promote rich description such as case studies appear to be appropriate to frame these studies.

APA, Harvard, Vancouver, ISO, and other styles

9

Wilson, C. L., C. I. Watson, and E. G. Paek. Effect of resolution and image quality on combined optical and neural network fingerprint matching. Gaithersburg, MD: National Institute of Standards and Technology, 1998. http://dx.doi.org/10.6028/nist.ir.6184.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Gabow, Harold N., and Robert E. Tarjan. Almost-Optimum Parallel Speed-Ups of Algorithms for Bipartite Matching and Related Problems. Fort Belvoir, VA: Defense Technical Information Center, January 1989. http://dx.doi.org/10.21236/ada215111.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!