971 search results - page 77 / 195 » Approximate Satisfiability and Equivalence |
144
click to vote
CSL
2002
Springer
15 years 6 months 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 ...
173
click to vote
SIAMCO
2002
15 years 6 months 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...
181
click to vote
ISAAC
2010
Springer
15 years 4 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...
191
click to vote
ICPPW
2009
IEEE
15 years 4 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...
159
click to vote
STOC
2005
ACM
16 years 6 months 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 ...