321 search results - page 22 / 65 » A Model for Change Propagation Based on Graph Rewriting |
115
click to vote
DKE
2000
15 years 3 months ago
2000
: Large information bases that are used by several different users and applications accommodate the demands of their users more effectively, if they can be split into possibly over...
139
click to vote
CAV
2009
Springer
16 years 4 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...
140
click to vote
ENTCS
2008
15 years 4 months ago
2008
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...
143
Voted
WEA
2007
Springer
15 years 10 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
164
click to vote
UAI
2008
15 years 5 months ago
2008
Inference problems in graphical models can be represented as a constrained optimization of a free energy function. It is known that when the Bethe free energy is used, the fixedpo...