4372 search results - page 43 / 875 » Algorithmic Theories of Everything |
147
Voted
CAV
2012
Springer
13 years 6 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
101
Voted
FOCM
2006
15 years 3 months ago
2006
We introduce some modifications and extensions of the concept od index pair in the Conley index theory. We then show how these concepts may be used to overcome some difficulties in...
124
Voted
DC
2000
15 years 3 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
99
Voted
AIMSA
1990
Springer
15 years 7 months ago
1990
Springer
: Automated deduction systems can considerably be improved by replacing axioms with special purpose inference mechanisms. For example replacing in resolution based systems certain ...
125
Voted
PODC
2003
ACM
15 years 9 months ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...