Listing 1 - 9 of 9 |
Sort by
|
Choose an application
This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing.
Discrete mathematics --- Matching theory. --- Combinatorial analysis. --- Matching Theory --- Combinatorics --- Algebra --- Mathematical analysis --- Combinatorial analysis --- Marriage theorem
Choose an application
The term "stringology" is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as "algorithmic jewels" and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms. In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.
Computer algorithms. --- Matching theory. --- Combinatorial analysis --- Marriage theorem --- Algorithms
Choose an application
Graph Factors and Matching Extensions deals with two important branches of graph theory - factor theory and extendable graphs. Due to the mature techniques and wide ranges of applications, factors and matchings become useful tools in investigation of many theoretical problems and practical issues. This book includes basic techniques, theoretical foundations, as well as recent advances in the field. It also discusses open problems and conjectures to inspire the readers. This book is primarily aimed at researchers and graduate students in graph theory and combinatorics in general. However, all t
Graph theory. --- Matching theory. --- Combinatorial analysis --- Marriage theorem --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Topology --- Extremal problems
Choose an application
Matching problems with preferences are all around us - they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists.In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. This book describes the most important results in this area, providing a timely upda
Computer algorithms. --- Algorithms --- Matching theory --- 681.3*F2 --- Combinatorial analysis --- Marriage theorem --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Matching theory. --- Marriage theorem. --- Computer science --- Mathematics.
Choose an application
Written in a step-by-step, tutorial style with a lot of code snippets and hands-on examples to create an advanced Magento theme from scratch, this book is tailor-made for web designers and developers.This book is great for developers and web designers who are looking to get a good grounding in how to create custom, responsive, and advanced Magento themes. Readers must have some experience with HTML, PHP, CSS, and Magento theme design. This book will be useful for anybody who already has knowledge of the Magento frontend structure.
Electronic commerce -- Computer programs. --- Open source software. --- Web sites -- Design. --- Web sites. --- Commerce --- Business & Economics --- Marketing & Sales --- Electronic commerce --- Web sites --- Computer programs. --- Design. --- Authorship --- Web site development --- Microformats --- Template matching (Digital image processing) --- E-books --- Matching, Template (Digital image processing) --- Image processing --- Matching theory --- Pattern recognition systems --- Digital techniques
Choose an application
This thesis discusses the random Euclidean bipartite matching problem, i.e., the matching problem between two different sets of points randomly generated on the Euclidean domain. The presence of both randomness and Euclidean constraints makes the study of the average properties of the solution highly relevant. The thesis reviews a number of known results about both matching problems and Euclidean matching problems. It then goes on to provide a complete and general solution for the one dimensional problem in the case of convex cost functionals and, moreover, discusses a potential approach to the average optimal matching cost and its finite size corrections in the quadratic case. The correlation functions of the optimal matching map in the thermodynamical limit are also analyzed. Lastly, using a functional approach, the thesis puts forward a general recipe for the computation of the correlation function of the optimal matching in any dimension and in a generic domain. iv>.
Discrete mathematics --- Mathematical statistics --- Mathematical physics --- Statistical physics --- thermodynamica --- grafentheorie --- statistiek --- wiskunde --- fysica --- Matching theory. --- Combinatorial analysis --- Marriage theorem --- Physics. --- Statistical physics. --- Dynamical systems. --- Mathematical physics. --- Mathematical Methods in Physics. --- Complex Systems. --- Mathematical Physics. --- Statistical Physics and Dynamical Systems. --- Physical mathematics --- Physics --- Dynamical systems --- Kinetics --- Mathematics --- Mechanics, Analytic --- Force and energy --- Mechanics --- Statics --- Natural philosophy --- Philosophy, Natural --- Physical sciences --- Dynamics --- Statistical methods
Choose an application
Over the past few decades, matching models, which use mathematical frameworks to analyze allocation mechanisms for heterogeneous products and individuals, have attracted renewed attention in both theoretical and applied economics. These models have been used in many contexts, from labor markets to organ donations, but recent work has tended to focus on "nontransferable" cases rather than matching models with transfers. In this important book, Pierre-André Chiappori fills a gap in the literature by presenting a clear and elegant overview of matching with transfers and provides a set of tools that enable the analysis of matching patterns in equilibrium, as well as a series of extensions. He then applies these tools to the field of family economics and shows how analysis of matching patterns and of the incentives thus generated can contribute to our understanding of long-term economic trends, including inequality and the demand for higher education.
Families --- Marriage --- Matching theory. --- Economic aspects. --- Becker-Coase theorem. --- Choo-Siow model. --- Gale-Shapley algorithm. --- Low model. --- Pareto weights. --- Roe v. Wade. --- Spence-Mirrlees condition. --- abortion. --- allocation. --- applied economics. --- assortative matching. --- bargaining models. --- birth control. --- comparative statics. --- cupid framework. --- divorce. --- econometrics. --- education. --- equilibrium. --- family economics. --- family formation. --- female empowerment. --- gender differences. --- hedonic equilibrium. --- hedonic models. --- heterogeneity. --- heterogeneous products. --- heteroskedasticity. --- higher education. --- household behavior. --- imperfectly transferable utility. --- income. --- individual utilities. --- inequality. --- intrafamily allocation. --- intrahousehold allocation. --- labor markets. --- marriage market. --- marriage. --- matching models. --- matching. --- metric spaces. --- multidimensional matching. --- nontransferable utility. --- optimal transportation. --- organ donations. --- positive assortative matching. --- preinvestment. --- remarriage. --- risk sharing. --- roommate matching. --- separability assumption. --- stability. --- supermodularity. --- transferable utility. --- transfers. --- wages.
Choose an application
This book constitutes the thoroughly refereed post-conference proceedings of the First International ICST Conference on Auctions, Market Mechanisms and Their Applications, AMMA 2009, held in Boston, MA, USA, in May 2009. The 16 revised papers presented were carefully reviewed and selected from 38 submissions. The contents range from fundamental theory on auctions and markets to empirical design and analysis of matching mechanisms, peer-to-peer-systems, and prediction markets. This includes an understanding of the economic and gametheoretic issues, the ability to design protocols and algorithms for realizing desired outcomes, and the knowledge of specific institutional details that are important in practical applications. This volume aims at economists, computer scientists, theorists and empiricists as well as academics and practitioners.
Auctions -- Congresses. --- Matching theory -- Congresses. --- Negotiation -- Congresses. --- Prediction theory -- Congresses. --- Auctions --- Prediction theory --- Matching theory --- Commerce --- Business & Economics --- Marketing & Sales --- Computers --- Information storage and retrieval systems. --- Law and legislation. --- Automatic data storage --- Automatic information retrieval --- Automation in documentation --- Computer-based information systems --- Data processing systems --- Data storage and retrieval systems --- Discovery systems, Information --- Information discovery systems --- Information processing systems --- Information retrieval systems --- Machine data storage and retrieval --- Mechanized information storage and retrieval systems --- Cyberspace --- Law and legislation --- Computer science. --- Computers. --- Computers and civilization. --- Management information systems. --- E-commerce. --- Computer Science. --- Theory of Computation. --- e-Commerce/e-business. --- Information Systems Applications (incl. Internet). --- Management of Computing and Information Systems. --- Computers and Society. --- Information Systems and Communication Service. --- Computer systems --- Electronic information resources --- Data libraries --- Digital libraries --- Information organization --- Information retrieval --- Information theory. --- Information Systems. --- Information systems. --- Communication theory --- Communication --- Cybernetics --- Informatics --- Science --- Application software. --- Cybercommerce --- E-business --- E-commerce --- E-tailing --- eBusiness --- eCommerce --- Electronic business --- Internet commerce --- Internet retailing --- Online commerce --- Web retailing --- Information superhighway --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Machine theory --- Calculators --- Civilization and computers --- Civilization --- EIS (Information systems) --- Executive information systems --- MIS (Information systems) --- Sociotechnical systems --- Information resources management --- Management --- Application computer programs --- Application computer software --- Applications software --- Apps (Computer software) --- Computer software --- Communication systems --- Dutch auctions --- Vendues --- Bailments --- Commercial law --- Forecasting theory --- Stochastic processes --- Combinatorial analysis --- Marriage theorem
Choose an application
Combinatorial analysis --- Computer algorithms. --- Analyse combinatoire --- Algorithmes --- Congresses. --- Congrès --- Computer Science --- Engineering & Applied Sciences --- Computer algorithms --- Matching theory --- Computer science. --- Data structures (Computer science). --- Algorithms. --- Information storage and retrieval. --- Text processing (Computer science). --- Pattern recognition. --- Bioinformatics. --- Computer Science. --- Pattern Recognition. --- Algorithm Analysis and Problem Complexity. --- Document Preparation and Text Processing. --- Information Storage and Retrieval. --- Data Structures. --- Bio-informatics --- Biological informatics --- Biology --- Information science --- Computational biology --- Systems biology --- Design perception --- Pattern recognition --- Form perception --- Perception --- Figure-ground perception --- Processing, Text (Computer science) --- Database management --- Electronic data processing --- Information storage and retrieval systems --- Word processing --- Algorism --- Algebra --- Arithmetic --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Informatics --- Science --- Data processing --- Foundations --- Marriage theorem --- Optical pattern recognition. --- Computer software. --- Natural language processing (Computer science). --- Information storage and retrieva. --- Data structures (Computer scienc. --- Natural Language Processing (NLP). --- NLP (Computer science) --- Artificial intelligence --- Human-computer interaction --- Semantic computing --- Software, Computer --- Computer systems --- Optical data processing --- Pattern perception --- Perceptrons --- Visual discrimination --- Information storage and retrieval systems. --- Automatic data storage --- Automatic information retrieval --- Automation in documentation --- Computer-based information systems --- Data processing systems --- Data storage and retrieval systems --- Discovery systems, Information --- Information discovery systems --- Information processing systems --- Information retrieval systems --- Machine data storage and retrieval --- Mechanized information storage and retrieval systems --- Electronic information resources --- Data libraries --- Digital libraries --- Information organization --- Information retrieval --- Pattern recognition systems. --- Artificial intelligence—Data processing. --- Automated Pattern Recognition. --- Data Science. --- Data centers --- Pattern classification systems --- Pattern recognition computers --- Computer vision
Listing 1 - 9 of 9 |
Sort by
|