4128 search results - page 157 / 826 » Learning and using relational theories |
141
Voted
AIIA
1995
Springer
15 years 4 months ago
1995
Springer
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
113
Voted
WWW
2009
ACM
16 years 1 months ago
2009
ACM
Measuring the similarity between semantic relations that hold among entities is an important and necessary step in various Web related tasks such as relation extraction, informati...
184
click to vote
Publication
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
114
click to vote
LICS
2002
IEEE
15 years 5 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
131
Voted
CSCLP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...