2723 search results - page 15 / 545 » Learning lexicographic orders |
MLDM
2008
Springer
13 years 7 months ago
2008
Springer
RTA
2005
Springer
14 years 26 days ago
2005
Springer
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...
ISSAC
2004
Springer
14 years 22 days ago
2004
Springer
We describe an algorithm for finding a canonical image of a set of points under the action of a permutation group. Specifically if we order images by sorting them and ordering t...
IMPERIAL
1993
13 years 11 months ago
1993
We describe some ideas and results about the following problem: Given a set, a family of \preference relations" on the set, and a \priority" among those preference relat...
ITA
2007
13 years 7 months ago
2007
This note is about functions f : Aω → Bω whose graph is recognized by a B¨uchi finite automaton on the product alphabet A × B. These functions are Baire class 2 in the Bair...