3575 search results - page 201 / 715 » Structured motifs search |
145
click to vote
CIKM
2005
Springer
16 years 5 days ago
2005
Springer
The goal of this Robot Ontology effort is to develop and begin to populate a neutral knowledge representation (the data structures) capturing relevant information about robots and...
227
click to vote
TAINN
2005
Springer
16 years 3 days ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
157
click to vote
GCB
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. The biomedical literature grows at a tremendous rate, so that finding the relevant literature is becoming more and more difficult. To address this problem we introduce ...
165
click to vote
AI
2003
Springer
15 years 12 months ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
172
click to vote
VLDB
1993
ACM
15 years 10 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...