Results 281 to 290 of about 1,191,687 (316)
Some of the next articles are maybe not open access.
Price Matching: To Match or Not to Match?
2016Regardless of the product category, market segment, geographic location, or target customer base, pricing and decisions about pricing tactics are among the most critical areas of a firm’s marketing strategy. Consumers have always been price conscious and focused on getting the lowest possible price.
Daniel G. Bachrach +3 more
openaire +1 more source
Preventive Medicine, 1995
Matching is an intuitively appealing design strategy for ensuring balance on one or more potential confounding variables, usually either among subjects who were exposed or unexposed to a suspected risk factor for disease in a cohort study or between diseased and nondiseased subjects in a case-control study.
openaire +2 more sources
Matching is an intuitively appealing design strategy for ensuring balance on one or more potential confounding variables, usually either among subjects who were exposed or unexposed to a suspected risk factor for disease in a cohort study or between diseased and nondiseased subjects in a case-control study.
openaire +2 more sources
Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2020
Community Question Answering (CQA) has become a primary means for people to acquire knowledge, where people are free to ask questions or submit answers. To enhance the efficiency of the service, similar question identification becomes a core task in CQA which aims to find a similar question from the archived repository whenever a new question is asked.
Zizhen Wang 0001 +8 more
openaire +1 more source
Community Question Answering (CQA) has become a primary means for people to acquire knowledge, where people are free to ask questions or submit answers. To enhance the efficiency of the service, similar question identification becomes a core task in CQA which aims to find a similar question from the archived repository whenever a new question is asked.
Zizhen Wang 0001 +8 more
openaire +1 more source
The British Accounting Review, 2005
Abstract This paper analyses the income smoothing effect of the matching principle in accounting. Income smoothing, under Gibbins and Willett [Gibbins, M., Willett, R., 1997. New light on accrual, aggregation and allocation, using an axiomatic analysis of accounting numbers' fundamental and statistical character.
openaire +2 more sources
Abstract This paper analyses the income smoothing effect of the matching principle in accounting. Income smoothing, under Gibbins and Willett [Gibbins, M., Willett, R., 1997. New light on accrual, aggregation and allocation, using an axiomatic analysis of accounting numbers' fundamental and statistical character.
openaire +2 more sources
Journal of Economic Theory, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
ACM Transactions on Programming Languages and Systems, 1996
A relation between recursive object types, called matching , has been proposed as a generalization of subtyping. Unlike subtyping, matching does not support subsumption, but it does support inheritance of binary methods. We argue that matching is a good idea, but that it should not be regarded as a form of F-bounded
Martín Abadi, Luca Cardelli
openaire +1 more source
A relation between recursive object types, called matching , has been proposed as a generalization of subtyping. Unlike subtyping, matching does not support subsumption, but it does support inheritance of binary methods. We argue that matching is a good idea, but that it should not be regarded as a form of F-bounded
Martín Abadi, Luca Cardelli
openaire +1 more source
SIAM Journal on Discrete Mathematics, 2002
Summary: We consider complete graphs with nonnegative edge weights. A \(p\)-matching is a set of \(p\) disjoint edges. We prove the existence of a maximal (with respect to inclusion) matching \(M\) that contains for any \(p\leq|M|\) \(p\) edges whose total weight is at least \({1\over \sqrt 2}\) of the maximum weight of a \(p\)-matching.
Refael Hassin, Shlomi Rubinstein
openaire +2 more sources
Summary: We consider complete graphs with nonnegative edge weights. A \(p\)-matching is a set of \(p\) disjoint edges. We prove the existence of a maximal (with respect to inclusion) matching \(M\) that contains for any \(p\leq|M|\) \(p\) edges whose total weight is at least \({1\over \sqrt 2}\) of the maximum weight of a \(p\)-matching.
Refael Hassin, Shlomi Rubinstein
openaire +2 more sources
Color Matching and Color-Difference Matching
Journal of the Optical Society of America, 1972The precision of color matching is commonly described by color-matching ellipses, and the precision of matching color differences can be described by color-difference-matching ellipses. Recently obtained sets of color-matching ellipses and color-difference-matching ellipses have been compared and some important correlations are indicated.
openaire +3 more sources
A review of multimodal image matching: Methods and applications
Information Fusion, 2021Xingyu Jiang, Jiayi Ma, Guobao Xiao
exaly