2314 search results - page 90 / 463 » Monoids over domains |
SAGT
2009
Springer
15 years 6 months ago
2009
Springer
Roberts’ theorem from 1979 states that the only incentive compatible mechanisms over a full domain and range of at least 3 are weighted variants of the VCG mechanism termed affin...
ICLP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Action description languages, such as A and B [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a me...
ICML
2004
IEEE
15 years 5 months ago
2004
IEEE
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
ISSAC
1999
Springer
15 years 4 months ago
1999
Springer
In this paper we consider the problem of fast computation of n-ary products, for large n, over arbitrary precision integer or rational number domains. The combination of loop unro...
FCT
2007
Springer
15 years 3 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...