1757 search results - page 110 / 352 » Alternating Refinement Relations |
120
click to vote
KR
2004
Springer
15 years 8 months ago
2004
Springer
Several logical languages have been considered in AI for encoding compactly preference relations over a set of alternatives. In this paper, we analyze both the expressiveness and ...
138
Voted
VLDB
2004
ACM
15 years 8 months ago
2004
ACM
Recommendations are crucial for the success of large websites. While there are many ways to determine recommendations, the relative quality of these recommenders depends on many f...
116
click to vote
TPHOL
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
166
Voted
GEM
2007
15 years 4 months ago
2007
- Besides the difficulty of the application problem to be solved with Genetic Algorithms (GAs), an additional difficulty arises because the quality of the solution found, or the ...
DATESO
2004
15 years 4 months ago
2004
In this paper we present a storage method for sets of first order logic terms in a relational database using function symbols based indexing method of Discrimination trees. This is...