1523 search results - page 98 / 305 » Partially ordered secretaries |
ARITH
1999
IEEE
15 years 5 months ago
1999
IEEE
A digit-recurrence algorithm for computing the Euclidean norm of a 3-dimensional vector is proposed. Starting from the vector component with the highest order of magnitude as the ...
90
Voted
ITP
2010
15 years 4 months ago
2010
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
108
click to vote
AIPS
1996
15 years 2 months ago
1996
Planning for manufacturing workpiecesis a complex task that requires the interaction of a domain-specific reasoner and a generic planning mechanism.In this paper wepresent an arch...
121
click to vote
COOPIS
2002
IEEE
15 years 5 months ago
2002
IEEE
We extend the description logic ¢¤£¦¥¦§©¨ with a preference order on the axioms. With this strict partial order certain axioms can be overruled, if defeated with more ...
138
Voted
ADC
2005
Springer
15 years 6 months ago
2005
Springer
The design and implementation of advanced personalized database applications requires a preference-driven approach. Representing preferences as strict partial orders is a good cho...