486 search results - page 97 / 98 » Improved upper bounds for 3-SAT |
CASES
2010
ACM
13 years 6 months ago
2010
ACM
Wired embedded networks must include multicast authentication to prevent masquerade attacks within the network. However, unique constraints for these networks make most existing m...
DLOG
2010
13 years 6 months ago
2010
In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We ...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
TMC
2011
13 years 3 months ago
2011
— Context information brings new opportunities for efficient and effective system resource management of mobile devices. In this work we focus on the use of context information t...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...