4112 search results - page 188 / 823 » Efficient Algorithms for the Spoonerism Problem |
158
click to vote
FATES
2006
Springer
15 years 10 months ago
2006
Springer
To efficiently solve safety verification and testing problems for an aspect-oriented system, we use multitape automata to model aspects and propose algorithms for the aspect-orient...
267
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
184
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifier-free finite-precision bit-vector logic (QF BV). Beaver uses an eager approach, enc...
169
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
Nowadays a placement problem often involves multi-million objects and excessive fixed blockages. We present a new global placement algorithm that scales well to the modern large-s...
186
click to vote
AAAI
2006
15 years 8 months ago
2006
Reasoning with both probabilistic and deterministic dependencies is important for many real-world problems, and in particular for the emerging field of statistical relational lear...