2376 search results - page 180 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
DAC
2003
ACM
14 years 9 months ago
2003
ACM
An efficient matrix solver is critical to the analytical placement. As the size of the matrix becomes huge, the multilevel methods turn out to be more efficient and more scalable....
WWW
2008
ACM
14 years 8 months ago
2008
ACM
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
SIGMOD
2003
ACM
14 years 8 months ago
2003
ACM
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
DAC
2009
ACM
14 years 2 months ago
2009
ACM
The latest advancements in the commercial formal model checkers have enabled the integration of formal property verification with the conventional testbench based methods in the o...