4797 search results - page 160 / 960 » The complexity of partition tasks |
139
click to vote
IJCAI
1993
15 years 7 months ago
1993
We consider the computational complexity of evaluating nested counterfactuals over a propositional knowledge base. Counterfactual implication models a statement "if p, then q...
183
click to vote
DLOG
2011
14 years 10 months ago
2011
In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services. This holds also for DLs, where research focused on the...
143
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
The widely used denoising algorithms based on nonlinear diffusion, such as Perona-Malik and total variation denoising, modify images toward piecewise constant functions. Though ed...
164
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
137
click to vote
ISAAC
2001
Springer
15 years 10 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...