3333 search results - page 332 / 667 » Abstract Proof Search |
160
click to vote
SAT
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most ...
165
click to vote
SEMWEB
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Where are all the semantic Web services today? In this paper, we briefly provide the preliminary results of searching the surface Web and the prominent citeseer archive ...
160
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
176
Voted
DBPL
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We present a simple Data Mining Logic (DML) that can express common data mining tasks, like “Find Boolean association rules” or “Find inclusion dependencies.” At ...
160
Voted
EKAW
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. This paper emphasizes the interest of XML meta-language for corporate knowledge management and presents an experiment of enterprise-ontologyguided search in XML documents...