3318 search results - page 368 / 664 » The Weak Instance Model |
126
click to vote
ADBIS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Query rewriting method is proposed for the heterogeneous information integration infrastructure formed by the subject mediator environment. Local as View (LAV) approach t...
137
click to vote
PPSN
2004
Springer
15 years 10 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
131
Voted
ICDS
2010
IEEE
15 years 10 months ago
2010
IEEE
—Learning ontology from text is a challenge in knowledge engineering research and practice. Learning relations between concepts is even more difficult work. However, when conside...
124
click to vote
CP
2003
Springer
15 years 10 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
127
Voted
ECAI
2000
Springer
15 years 9 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...