1161 search results - page 79 / 233 » Kinetic Dependence Graphs |
219
click to vote
CSR
2011
Springer
14 years 8 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
168
click to vote
MOZ
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Extensible Dependency Grammar (XDG) is a graph description language whose formulas can be solved by constraint programming. XDG is designed so as to yield a declarative a...
136
click to vote
FMCO
2003
Springer
15 years 10 months ago
2003
Springer
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...
139
Voted
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...
124
Voted
PADS
1997
ACM
15 years 9 months ago
1997
ACM
Multi-resolution representation of simulated entities is considered essentialfor a growing portion of distributed simulations. Heretofore,modelers have representedentites at just ...