971 search results - page 77 / 195 » Approximate Satisfiability and Equivalence |
85
Voted
CSL
2002
Springer
15 years 14 days ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
114
Voted
SIAMCO
2002
15 years 9 days ago
2002
An optimal stochastic control problem is considered for systems with unbounded controls satisfying an integral constraint. It is shown that there exists an optimal control within t...
114
Voted
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
The concept of neighbor system, introduced by Hartvigsen (2009), is a set of integral vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship...
118
Voted
ICPPW
2009
IEEE
14 years 10 months ago
2009
IEEE
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...
105
Voted
STOC
2005
ACM
16 years 29 days ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...