Results 131 to 140 of about 432,855 (169)
Some of the next articles are maybe not open access.
International Game Theory Review, 2004
Given an n-person game (N, v), a reduced game (T, vT) is the game obtained if some subset T of the players assumes reasonable behavior on the part of the remaining players and uses that as a given so as to bargain within T. This "reasonable" behavior on the part of N-T must be defined in terms of some solution concept, ϕ, and so the reduced game ...
openaire +2 more sources
Given an n-person game (N, v), a reduced game (T, vT) is the game obtained if some subset T of the players assumes reasonable behavior on the part of the remaining players and uses that as a given so as to bargain within T. This "reasonable" behavior on the part of N-T must be defined in terms of some solution concept, ϕ, and so the reduced game ...
openaire +2 more sources
Making consistency more consistent
Proceedings of the 5th Workshop on the Principles and Practice of Consistency for Distributed Data, 2018Ordering guarantees are often defined using abstract execution models [2, 8-11, 19, 22]. Unfortunately, these models are complex and make different assumptions about system semantics. As a result, researchers find it impossible to compare the ordering guarantees of coherence, consistency and isolation.
Adriana Szekeres, Irene Zhang
openaire +1 more source
CONSIST-Consistent Internet route updates
The IEEE symposium on Computers and Communications, 2010An Internet router may receive a batch of tens of thousands of updates (insert a new rule or delete/change an existing rule) in any instant (i.e., with the same time stamp). This paper deals with analyzing possible orderings of a batch of updates such that forwarding table consistency is maintained while these updates are performed one at a time as in ...
Tania Mishra, Sartaj Sahni
openaire +1 more source
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, 2001
We investigate the performance of metasearch algorithms in terms of how much they improve consistency. We find that three different metasearch algorithms, each over three datasets, usually improve the consistency of search results; sometimes the improvement is dramatic. Furthermore, consistency tends to improve when performance improves.
Javed A. Aslam, Mark H. Montague
openaire +1 more source
We investigate the performance of metasearch algorithms in terms of how much they improve consistency. We find that three different metasearch algorithms, each over three datasets, usually improve the consistency of search results; sometimes the improvement is dramatic. Furthermore, consistency tends to improve when performance improves.
Javed A. Aslam, Mark H. Montague
openaire +1 more source
Communications of the ACM, 2018
For many data items, the work never settles on a value.
openaire +1 more source
For many data items, the work never settles on a value.
openaire +1 more source
Studia Logica, 2007
The author introduces an alternative notation for presenting Reiter-style default logics. As in the case of cumulative default logics, the essential idea is to enrich the basic objects of the logic. Rather than being just propositional formulae, they are ordered pairs of propositional formulae; the first item of each pair records the assertion being ...
openaire +2 more sources
The author introduces an alternative notation for presenting Reiter-style default logics. As in the case of cumulative default logics, the essential idea is to enrich the basic objects of the logic. Rather than being just propositional formulae, they are ordered pairs of propositional formulae; the first item of each pair records the assertion being ...
openaire +2 more sources
On the consistency of consistent conjectures
Economics Letters, 1984Abstract A Consistent Conjectures Equilibrium, CCE, requires that firms be correct in their beliefs concerning rival behavior. This paper presents conditions which ensure equivalence of CCE's in price and quantity models of oligopoly.
openaire +1 more source
On the Consistency of a Separator
Quaestiones Mathematicae, 2010A smoother can be called a separator if it is idempotent and co-idempotent, with the motivation coming from a physical analogy. This is a rudementary consistency, and type of “linearity”, which has been found to occur in practice. All the LULU-separator turn out to act linearly on any non-negative combination of the two outputs of such separators. This
Harper J.P., Rohwer C.H.
openaire +3 more sources
Journal of Medical Ethics, 2019
In a recent paper— The disvalue of death in the global burden of disease 1—we question the commensurability of the two components of the disability-adjusted life year (DALY)— years lived with disability (YLDs) and years of life lost (YLLs)—and offer a tentative solution to this problem. In an exciting and constructive reply— Is consistency overrated? 2—
Carl Tollef Solberg +2 more
openaire +2 more sources
In a recent paper— The disvalue of death in the global burden of disease 1—we question the commensurability of the two components of the disability-adjusted life year (DALY)— years lived with disability (YLDs) and years of life lost (YLLs)—and offer a tentative solution to this problem. In an exciting and constructive reply— Is consistency overrated? 2—
Carl Tollef Solberg +2 more
openaire +2 more sources
Artificial Intelligence, 1987
Advances of the past decade in methods and computer programs for showing consistency of proof systems based on first-order equations have made it feasible, in some settings, to use proof by consistency as an alternative to conventional rules of inference.
Deepak Kapur, David R. Musser
openaire +2 more sources
Advances of the past decade in methods and computer programs for showing consistency of proof systems based on first-order equations have made it feasible, in some settings, to use proof by consistency as an alternative to conventional rules of inference.
Deepak Kapur, David R. Musser
openaire +2 more sources