255 search results - page 38 / 51 » Inferring design patterns using the ReP graph |
97
Voted
WWW
2009
ACM
16 years 1 months ago
2009
ACM
We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities ? represented by globally identifiable declarative artifacts ...
111
click to vote
PLILP
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
88
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
104
click to vote
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
152
click to vote
CPAIOR
2010
Springer
14 years 10 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...