Zaloguj się

Gotowe bibliografie tematyczne / Optimal matching / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Optimal matching.

Artykuły w czasopismach na temat „Optimal matching”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 11 marca 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Optimal matching”.

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.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

CHENG, EDDIE, i SACHIN PADMANABHAN. "MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES". Parallel Processing Letters 22, nr 02 (16.05.2012): 1250005. http://dx.doi.org/10.1142/s0129626412500053.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

3

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

5

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

6

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

8

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Fredriksson, Kimmo, i Szymon Grabowski. "Average-optimal string matching". Journal of Discrete Algorithms 7, nr 4 (grudzień 2009): 579–94. http://dx.doi.org/10.1016/j.jda.2008.09.001.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Deng, Xiaotie. "Distributed near-optimal matching". Combinatorica 16, nr 4 (grudzień 1996): 453–64. http://dx.doi.org/10.1007/bf01271265.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

CHENG, EDDIE, DAVID LU i BRIAN XU. "STRONG MATCHING PRECLUSION OF PANCAKE GRAPHS". Journal of Interconnection Networks 14, nr 02 (czerwiec 2013): 1350007. http://dx.doi.org/10.1142/s0219265913500072.

Pełny tekst źródła

Streszczenie:

The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. In this paper, we examine the properties of pancake graphs by finding its strong matching preclusion number and categorizing all optimal solutions.

Style APA, Harvard, Vancouver, ISO itp.

14

Bienkowski, Marcin, David Fuchssteiner, Jan Marcinkowski i Stefan Schmid. "Online Dynamic B-Matching". ACM SIGMETRICS Performance Evaluation Review 48, nr 3 (5.03.2021): 99–108. http://dx.doi.org/10.1145/3453953.3453976.

Pełny tekst źródła

Streszczenie:

This paper initiates the study of online algorithms for the maximum weight b-matching problem, a generalization of maximum weight matching where each node has at most b≥1 adjacent matching edges. The problem is motivated by emerging optical technologies which allow to enhance datacenter networks with reconfigurable matchings, providing direct connectivity between frequently communicating racks. These additional links may improve network performance, by leveraging spatial and temporal structure in the workload. We show that the underlying algorithmic problem features an intriguing connection to online paging (a.k.a. caching), but introduces a novel challenge. Our main contribution is an online algorithm which is O(b)- competitive; we also prove that this is asymptotically optimal. We complement our theoretical results with extensive trace-driven simulations, based on real-world datacenter workloads as well as synthetic traffic traces.

Style APA, Harvard, Vancouver, ISO itp.

15

Peters, Jannik. "Online Elicitation of Necessarily Optimal Matchings". Proceedings of the AAAI Conference on Artificial Intelligence 36, nr 5 (28.06.2022): 5164–72. http://dx.doi.org/10.1609/aaai.v36i5.20451.

Pełny tekst źródła

Streszczenie:

In this paper, we study the problem of eliciting preferences of agents in the house allocation model. For this we build on a recently introduced model and focus on the task of eliciting preferences to find matchings which are necessarily optimal, i.e., optimal under all possible completions of the elicited preferences. In particular, we investigate the elicitation of necessarily Pareto optimal (NPO) and necessarily rank-maximal (NRM) matchings. Most importantly, we answer an open question and give an online algorithm for eliciting an NRM matching in the next-best query model which is 3/2-competitive, i.e., it takes at most 3/2 as many queries as an optimal algorithm. Besides this, we extend this field of research by introducing two new natural models of elicitation and by studying both the complexity of determining whether a necessarily optimal matching exists in them, and by giving online algorithms for these models.

Style APA, Harvard, Vancouver, ISO itp.

16

Anantapantula, Sai, Christopher Melekian i Eddie Cheng. "Matching Preclusion for the Shuffle-Cubes". Parallel Processing Letters 28, nr 03 (wrzesień 2018): 1850012. http://dx.doi.org/10.1142/s0129626418500123.

Pełny tekst źródła

Streszczenie:

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. A graph is maximally matched if its matching preclusion number is equal to its minimum degree, and is super matched if the matching preclusion number can only be achieved by deleting all edges incident to a single vertex. In this paper, we determine the matching preclusion number and classify the optimal matching preclusion sets for the shuffle-cube graphs, a variant of the well-known hypercubes.

Style APA, Harvard, Vancouver, ISO itp.

17

CHENG, EDDIE, i LÁSZLÓ LIPTÁK. "CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS". Parallel Processing Letters 23, nr 01 (marzec 2013): 1350004. http://dx.doi.org/10.1142/s0129626413500047.

Pełny tekst źródła

Streszczenie:

The matching preclusion number of an even graph G, denoted by mp (G), is the minimum number of edges whose deletion leaves the resulting graph without perfect matchings. The conditional matching preclusion number of an even graph G, denoted by mp 1(G), is the minimum number of edges whose deletion leaves the resulting graph with neither perfect matchings nor isolated vertices. The class of (n,k)-star graphs is a popular class of interconnection networks for which the matching preclusion number and the classification of the corresponding optimal solutions were known. However, the conditional version of this problem was open. In this paper, we determine the conditional matching preclusion for (n,k)-star graphs as well as classify the corresponding optimal solutions via several new results. In addition, an alternate proof of the results on the matching preclusion problem will also be given.

Style APA, Harvard, Vancouver, ISO itp.

18

WANG, SHUENN-SHYANG, i BOR-SEN CHEN. "Model matching: optimal approximation approach". International Journal of Control 45, nr 6 (czerwiec 1987): 1899–907. http://dx.doi.org/10.1080/00207178708933854.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Rosenbaum, Paul R. "Optimal Matching for Observational Studies". Journal of the American Statistical Association 84, nr 408 (grudzień 1989): 1024–32. http://dx.doi.org/10.1080/01621459.1989.10478868.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Yukich, J. E. "Optimal matching and empirical measures". Proceedings of the American Mathematical Society 107, nr 4 (1.04.1989): 1051. http://dx.doi.org/10.1090/s0002-9939-1989-1000171-8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Huang, Chun-Hsi, Xin He i Min Qian. "Communication-optimal parallel parenthesis matching". Parallel Computing 32, nr 1 (styczeń 2006): 14–23. http://dx.doi.org/10.1016/j.parco.2005.07.001.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

Ben-Kiki, Oren, Philip Bille, Dany Breslauer, Leszek Ga̧sieniec, Roberto Grossi i Oren Weimann. "Towards optimal packed string matching". Theoretical Computer Science 525 (marzec 2014): 111–29. http://dx.doi.org/10.1016/j.tcs.2013.06.013.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Allen, Jeffery C., i John W. Rockway. "Characterizing Optimal Multiport Matching Transformers". Circuits, Systems, and Signal Processing 31, nr 4 (14.01.2012): 1513–34. http://dx.doi.org/10.1007/s00034-011-9387-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Biemann, Torsten, i Deepak K. Datta. "Optimal Matching in Management Research". Academy of Management Proceedings 2012, nr 1 (lipiec 2012): 12910. http://dx.doi.org/10.5465/ambpp.2012.12910abstract.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Greevy, R. "Optimal multivariate matching before randomization". Biostatistics 5, nr 2 (1.04.2004): 263–75. http://dx.doi.org/10.1093/biostatistics/5.2.263.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Amir, Amihood, Gary Benson i Martin Farach. "Optimal Two-Dimensional Compressed Matching". Journal of Algorithms 24, nr 2 (sierpień 1997): 354–79. http://dx.doi.org/10.1006/jagm.1997.0860.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Allauzen, Cyril, i Mathieu Raffinot. "Simple Optimal String Matching Algorithm". Journal of Algorithms 36, nr 1 (lipiec 2000): 102–16. http://dx.doi.org/10.1006/jagm.2000.1087.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Cox, Pedro, Henri Maitre, Michel Minoux i Celso Ribeiro. "Optimal matching of convex polygons". Pattern Recognition Letters 9, nr 5 (czerwiec 1989): 327–34. http://dx.doi.org/10.1016/0167-8655(89)90061-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Ventura, Jose A., i Jen-Ming Chen. "Optimal matching of nonconvex polygons". Pattern Recognition Letters 14, nr 6 (czerwiec 1993): 445–52. http://dx.doi.org/10.1016/0167-8655(93)90023-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Coles, Peter, i Ran Shorrer. "Optimal truncation in matching markets". Games and Economic Behavior 87 (wrzesień 2014): 591–615. http://dx.doi.org/10.1016/j.geb.2014.01.005.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Cunningham, William H., i James F. Geelen. "The optimal path-matching problem". Combinatorica 17, nr 3 (wrzesień 1997): 315–37. http://dx.doi.org/10.1007/bf01215915.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

Lesnard, Laurent, i Thibaut de Saint Pol. "Introduction aux méthodes d'appariement optimal (Optimal Matching Analysis)". Bulletin of Sociological Methodology/Bulletin de Méthodologie Sociologique 90, nr 1 (kwiecień 2006): 5–25. http://dx.doi.org/10.1177/075910630609000103.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

CHENG, EDDIE, i OMER SIDDIQUI. "Strong Matching Preclusion of Arrangement Graphs". Journal of Interconnection Networks 16, nr 02 (czerwiec 2016): 1650004. http://dx.doi.org/10.1142/s0219265916500043.

Pełny tekst źródła

Streszczenie:

The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph with neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. The class of arrangement graphs was introduced as a common generalization of the star graphs and alternating group graphs, and to provide an even richer class of interconnection networks. In this paper, the goal is to find the strong matching preclusion number of arrangement graphs and to categorize all optimal strong matching preclusion sets of these graphs.

Style APA, Harvard, Vancouver, ISO itp.

34

BONNEVILLE, PHILIP, EDDIE CHENG i JOSEPH RENZI. "STRONG MATCHING PRECLUSION FOR THE ALTERNATING GROUP GRAPHS AND SPLIT-STARS". Journal of Interconnection Networks 12, nr 04 (grudzień 2011): 277–98. http://dx.doi.org/10.1142/s0219265911003003.

Pełny tekst źródła

Streszczenie:

The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem and has recently been introduced by Park and Ihm.15 In this paper, we examine properties of strong matching preclusion for alternating group graphs, by finding their strong matching preclusion numbers and categorizing all optimal solutions. More importantly, we prove a general result on taking a Cartesian product of a graph with K2 (an edge) to obtain the corresponding results for split-stars.

Style APA, Harvard, Vancouver, ISO itp.

35

Chen, Jiehua, Piotr Skowron i Manuel Sorge. "Matchings under Preferences: Strength of Stability and Tradeoffs". ACM Transactions on Economics and Computation 9, nr 4 (31.12.2021): 1–55. http://dx.doi.org/10.1145/3485000.

Pełny tekst źródła

Streszczenie:

We propose two solution concepts for matchings under preferences: robustness and near stability . The former strengthens while the latter relaxes the classical definition of stability by Gale and Shapley (1962). Informally speaking, robustness requires that a matching must be stable in the classical sense, even if the agents slightly change their preferences. Near stability, however, imposes that a matching must become stable (again, in the classical sense) provided the agents are willing to adjust their preferences a bit. Both of our concepts are quantitative; together they provide means for a fine-grained analysis of the stability of matchings. Moreover, our concepts allow the exploration of tradeoffs between stability and other criteria of social optimality, such as the egalitarian cost and the number of unmatched agents. We investigate the computational complexity of finding matchings that implement certain predefined tradeoffs. We provide a polynomial-time algorithm that, given agent preferences, returns a socially optimal robust matching (if it exists), and we prove that finding a socially optimal and nearly stable matching is computationally hard.

Style APA, Harvard, Vancouver, ISO itp.

36

Ma, Tianlong, Yaping Mao, Eddie Cheng i Jinling Wang. "Fractional Matching Preclusion for (n, k)-Star Graphs". Parallel Processing Letters 28, nr 04 (grudzień 2018): 1850017. http://dx.doi.org/10.1142/s0129626418500172.

Pełny tekst źródła

Streszczenie:

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. As a generalization, Liu and Liu introduced the concept of fractional matching preclusion number in 2017. The Fractional Matching Preclusion Number (FMP number) of G is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The Fractional Strong Matching Preclusion Number (FSMP number) of G is the minimum number of vertices and/or edges whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the FMP number and the FSMP number for (n, k)-star graphs. In addition, all the optimal fractional strong matching preclusion sets of these graphs are categorized.

Style APA, Harvard, Vancouver, ISO itp.

37

Wang, Xia, Tianlong Ma, Jun Yin i Chengfu Ye. "Fractional matching preclusion for radix triangular mesh". Discrete Mathematics, Algorithms and Applications 11, nr 04 (sierpień 2019): 1950048. http://dx.doi.org/10.1142/s1793830919500484.

Pełny tekst źródła

Streszczenie:

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. As a generalization, Liu and Liu recently introduced the concept of fractional matching preclusion number. The fractional matching preclusion number (FMP number) of [Formula: see text], denoted by [Formula: see text], is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The fractional strong matching preclusion number (FSMP number) of [Formula: see text], denoted by [Formula: see text], is the minimum number of vertices and edges whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we study the fractional matching preclusion number and the fractional strong matching preclusion number for the radix triangular mesh [Formula: see text], and all the optimal fractional matching preclusion sets and fractional strong matching preclusion sets of these graphs are categorized.

Style APA, Harvard, Vancouver, ISO itp.

38

Hosseini, Hadi, Vijay Menon, Nisarg Shah i Sujoy Sikdar. "Necessarily Optimal One-Sided Matchings". Proceedings of the AAAI Conference on Artificial Intelligence 35, nr 6 (18.05.2021): 5481–88. http://dx.doi.org/10.1609/aaai.v35i6.16690.

Pełny tekst źródła

Streszczenie:

We study the classical problem of matching n agents to n objects, where the agents have ranked preferences over the objects. We focus on two popular desiderata from the matching literature: Pareto optimality and rank-maximality. Instead of asking the agents to report their complete preferences, our goal is to learn a desirable matching from partial preferences, specifically a matching that is necessarily Pareto optimal (NPO) or necessarily rank-maximal (NRM) under any completion of the partial preferences. We focus on the top-k model in which agents reveal a prefix of their preference rankings. We design efficient algorithms to check if a given matching is NPO or NRM, and to check whether such a matching exists given top-k partial preferences. We also study online algorithms for eliciting partial preferences adaptively, and prove bounds on their competitive ratio.

Style APA, Harvard, Vancouver, ISO itp.

39

Abeywickrama, Tenindra, Victor Liang i Kian-Lee Tan. "Bipartite Matching". ACM SIGMOD Record 51, nr 1 (31.05.2022): 51–58. http://dx.doi.org/10.1145/3542700.3542713.

Pełny tekst źródła

Streszczenie:

The Kuhn-Munkres (KM) algorithm is a classical combinatorial optimization algorithm that is widely used for minimum cost bipartite matching in many real-world applications, such as transportation. For example, a ride-hailing service may use it to find the optimal assignment of drivers to passengers to minimize the overall wait time. Typically, given two bipartite sets, this process involves computing the edge costs between all bipartite pairs and finding an optimal matching. However, existing works overlook the impact of edge cost computation on the overall running time. In reality, edge computation often significantly outweighs the computation of the optimal assignment itself, as in the case of assigning drivers to passengers which involves computation of expensive graph shortest paths. Following on from this, we also observe common real-world settings exhibit a useful property that allows us to incrementally compute edge costs only as required using an inexpensive lower-bound heuristic. This technique significantly reduces the overall cost of assignment compared to the original KM algorithm, as we demonstrate experimentally on multiple real-world data sets and workloads. Moreover, our algorithm is not limited to this domain and is potentially applicable in other settings where lower-bounding heuristics are available.

Style APA, Harvard, Vancouver, ISO itp.

40

Reny, Philip J. "Efficient Matching in the School Choice Problem". American Economic Review 112, nr 6 (1.06.2022): 2025–43. http://dx.doi.org/10.1257/aer.20210240.

Pełny tekst źródła

Streszczenie:

Stable matchings in school choice needn’t be Pareto efficient and can leave thousands of students worse off than necessary. Call a matching μ priority-neutral if no matching can make any student whose priority is violated by μ better off without violating the priority of some student who is made worse off. Call a matching priority-efficient if it is priority-neutral and Pareto efficient. We show that there is a unique priority-efficient matching and that it dominates every priority-neutral matching and every stable matching. Moreover, truth-telling is a maxmin optimal strategy for every student in the mechanism that selects the priority-efficient matching. (JEL C78, I21, I28)

Style APA, Harvard, Vancouver, ISO itp.

41

Abbott, Andrew, i John Forrest. "Optimal Matching Methods for Historical Sequences". Journal of Interdisciplinary History 16, nr 3 (1986): 471. http://dx.doi.org/10.2307/204500.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

van Sambeeck, J. H. J., S. P. J. van Brummelen, N. M. van Dijk i M. P. Janssen. "Optimal blood issuing by comprehensive matching". European Journal of Operational Research 296, nr 1 (styczeń 2022): 240–53. http://dx.doi.org/10.1016/j.ejor.2021.02.054.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Cologne, John B., i Yoshisada Shibata. "OPTIMAL CASE-CONTROL MATCHING IN PRACTICE". Epidemiology 6, nr 3 (maj 1995): 271–75. http://dx.doi.org/10.1097/00001648-199505000-00014.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Zohdy, M., Nan Loh i A. A. Abdul-Wahab. "A robust optimal model matching control". IEEE Transactions on Automatic Control 32, nr 5 (maj 1987): 410–14. http://dx.doi.org/10.1109/tac.1987.1104617.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Jiancang, Su, Sun Jian, Liu Guozhi, Liu Chunliang i Ding Zhenjie. "Optimal Matching of Magnetic Pulse Compressor". Plasma Science and Technology 8, nr 2 (marzec 2006): 229–33. http://dx.doi.org/10.1088/1009-0630/8/2/22.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Shayevitz, Ofer, i Meir Feder. "Optimal Feedback Communication Via Posterior Matching". IEEE Transactions on Information Theory 57, nr 3 (marzec 2011): 1186–222. http://dx.doi.org/10.1109/tit.2011.2104992.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Yang, C. D., H. Y. Chung i J. L. Chang. "Optimal model matching: H2 or H∞?" Electronics Letters 26, nr 25 (1990): 2089. http://dx.doi.org/10.1049/el:19901346.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Roumy, Aline, i David Gesbert. "Optimal Matching in Wireless Sensor Networks". IEEE Journal of Selected Topics in Signal Processing 1, nr 4 (grudzień 2007): 725–35. http://dx.doi.org/10.1109/jstsp.2007.909378.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Vishkin, Uzi. "Optimal parallel pattern matching in strings". Information and Control 67, nr 1-3 (październik 1985): 91–113. http://dx.doi.org/10.1016/s0019-9958(85)80028-0.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Galil, Zvi. "Optimal parallel algorithms for string matching". Information and Control 67, nr 1-3 (październik 1985): 144–57. http://dx.doi.org/10.1016/s0019-9958(85)80031-0.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!