Results 1  10
of
1,169
ELEMENTARY APPLICATIONS OF A TECHNICAL THEOREM
"... Abstract. Mochizuki proves a technical theorem concerning the stack of “dormant torally indigenous bundles ” over the stack of stable curves; without saying anything about what these bundles are, we give two elementary applications of this result, the first (joint with Fu Liu) to counting lattice po ..."
Abstract
 Add to MetaCart
Abstract. Mochizuki proves a technical theorem concerning the stack of “dormant torally indigenous bundles ” over the stack of stable curves; without saying anything about what these bundles are, we give two elementary applications of this result, the first (joint with Fu Liu) to counting lattice
Auction Theory: A Guide to the Literature
 JOURNAL OF ECONOMIC SURVEYS
, 1999
"... This paper provides an elementary, nontechnical, survey of auction theory, by introducing and describing some of the critical papers in the subject. (The most important of these are reproduced in a companion book, The Economic Theory of Auctions, Paul Klemperer (ed.), Edward Elgar (pub.), forthco ..."
Abstract

Cited by 534 (5 self)
 Add to MetaCart
This paper provides an elementary, nontechnical, survey of auction theory, by introducing and describing some of the critical papers in the subject. (The most important of these are reproduced in a companion book, The Economic Theory of Auctions, Paul Klemperer (ed.), Edward Elgar (pub
A ParameterLess Genetic Algorithm
 IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
, 1999
"... From the user's point of view, setting the parameters of a genetic algorithm (GA) is far from a trivial task. Moreover, the user is typically not interested in population sizes, crossover probabilities, selection rates, and other GA technicalities. He is just interested in solving a probl ..."
Abstract

Cited by 284 (35 self)
 Add to MetaCart
From the user's point of view, setting the parameters of a genetic algorithm (GA) is far from a trivial task. Moreover, the user is typically not interested in population sizes, crossover probabilities, selection rates, and other GA technicalities. He is just interested in solving a
An Impossibility Theorem for Clustering
, 2002
"... Although the study of clustering is centered around an intuitively compelling goal, it has been very di#cult to develop a unified framework for reasoning about it at a technical level, and profoundly diverse approaches to clustering abound in the research community. Here we suggest a formal pers ..."
Abstract

Cited by 137 (0 self)
 Add to MetaCart
Although the study of clustering is centered around an intuitively compelling goal, it has been very di#cult to develop a unified framework for reasoning about it at a technical level, and profoundly diverse approaches to clustering abound in the research community. Here we suggest a formal
Multilanguage Hierarchical Logics (or: How We Can Do Without Modal Logics)
, 1994
"... MultiLanguage systems (ML systems) are formal systems allowing the use of multiple distinct logical languages. In this paper we introduce a class of ML systems which use a hierarchy of first order languages, each language containing names for the language below, and propose them as an alternative to ..."
Abstract

Cited by 212 (52 self)
 Add to MetaCart
to modal logics. The motivations of our proposal are technical, epistemological and implementational. From a technical point of view, we prove, among other things, that the set of theorems of the most common modal logics can be embedded (under the obvious bijective mapping between a modal and a first order
OKBC: A programmatic foundation for knowledge base interoperability
, 1998
"... The technology for building large knowledge bases (KBs) is yet to witness a breakthrough so that a KB can be constructed by the assembly of prefabricated knowledge components. Knowledge components include both pieces of domain knowledge (for example, theories of economics or fault diagnosis) and KB ..."
Abstract

Cited by 195 (13 self)
 Add to MetaCart
tools (for example, editors and theorem provers). Most of the current KB development tools can only manipulate knowledge residing in the knowledge representation system (KRS) for which the tools were originally developed. Open Knowledge Base Connectivity (OKBC) is an application programming interface
An Algorithmic Proof Theory for Hypergeometric (ordinary and ``$q$'') Multisum/integral Identities
, 1991
"... this paper we show that these fast algorithms can be extended to the much larger class of multisum terminating hypergeometric (or equivalently, binomial coefficient) identities, to constant term identities of DysonMacdonald type, to MehtaDyson type integrals, and more generally, to identities inv ..."
Abstract

Cited by 189 (17 self)
 Add to MetaCart
the same for single and multi (terminating) qhypergeometric identities, with continuous and/or discrete variables. Here we describe these algorithms in general, and prove their validity. The validity is an immediate consequence of what we call "The fundamental theorem of hypergeometric summation
On Folk Theorems
, 1980
"... this paper is to refine this definition somewhat, adapting it to the purposes of the research community in computer science. Accordingly, we shall attempt to provide a reasonable definition of or, rather, criteria for folk theorems, followed by a detailed example illustrating the ideas. The latter e ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
to introduce no new technical material in this paper, and moreover, since researchers in our community seem to be less familiar with folklore than with theorems, Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial
NOMINAL ALGEBRA AND THE HSP THEOREM (TECHNICAL REPORT)
"... Abstract. Nominal algebra is a logic of equality developed to reason algebraically in the presence of binding. In previous work the authors have shown how nominal algebra can be used to specify and reason algebraically about systems with binding, such as firstorder logic, the λcalculus, or process ..."
Abstract
 Add to MetaCart
calculus, or process calculi. Nominal algebra has a semantics in nominal sets (sets with a finitelysupported permutation action) and in previous work the authors proved soundness and completeness. The HSP theorem characterises the class of models of an algebraic theory as a class closed under homomorphic images
Results 1  10
of
1,169