23590 search results - page 141 / 4718 » Algorithm Performance Contest |
OWLED
2008
13 years 10 months ago
2008
Predicting the performance of a tableau reasoner for an OWL ontology is generally hard. It is even harder for users who are not familiar with the details of tableau algorithms. In ...
UAI
2008
13 years 10 months ago
2008
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
BNCOD
2004
13 years 10 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
AUTOMATICA
2008
13 years 9 months ago
2008
Data-based control design methods most often consist of iterative adjustment of the controller's parameters towards the parameter values which minimize an H2 performance crit...