129 search results - page 8 / 26 » Benchmarking Reasoners for Multi-Ontology Applications |
PLDI
2010
ACM
14 years 5 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
OOPSLA
2007
Springer
14 years 1 months ago
2007
Springer
Java performance is far from being trivial to benchmark because it is affected by various factors such as the Java application, its input, the virtual machine, the garbage collect...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
Given the current trend towards application interoperability and XML-based data integration, there is an increasing need for XML interfaces to relational database management system...
SGAI
2009
Springer
14 years 4 days ago
2009
Springer
Feature subset selection has become more and more a common topic of research. This popularity is partly due to the growth in the number of features and application domains. The fa...
ICDCS
2011
IEEE
12 years 7 months ago
2011
IEEE
—Resource provisioning for N-tier web applications in Clouds is non-trivial due to at least two reasons. First, there is an inherent optimization conflict between cost of resour...