6274 search results - page 537 / 1255 » From query complexity to computational complexity |
206
click to vote
DEXA
2010
Springer
15 years 8 months ago
2010
Springer
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
237
click to vote
SMA
2009
ACM
16 years 1 months ago
2009
ACM
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
220
click to vote
OOPSLA
2007
Springer
16 years 1 months ago
2007
Springer
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
236
click to vote
DILS
2008
Springer
15 years 8 months ago
2008
Springer
It is not always clear how best to represent integrated data sets, and which application and database features allow a scientist to take best advantage of data coming from various ...
243
click to vote
LPAR
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...