Sciweavers

610 search results - page 96 / 122
» Using SAT in QBF
Sort
View
CCCG
2009
13 years 8 months ago
Inapproximability of the Perimeter Defense Problem
We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such th...
Evangelos Kranakis, Danny Krizanc, Lata Narayanan,...
ENTCS
2006
134views more  ENTCS 2006»
13 years 7 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
IJISEC
2007
66views more  IJISEC 2007»
13 years 7 months ago
Protecting data privacy through hard-to-reverse negative databases
The paper extends the idea of negative representations of information for enhancing privacy. Simply put, a set DB of data elements can be represented in terms of its complement set...
Fernando Esponda, Elena S. Ackley, Paul Helman, Ha...
JPDC
2007
86views more  JPDC 2007»
13 years 7 months ago
Performance evaluation of a new scheduling algorithm for distributed systems with security heterogeneity
High quality of security is increasingly critical for applications running on heterogeneous distributed systems. However, existing scheduling algorithms for heterogeneous distribu...
Tao Xie 0004, Xiao Qin
DSD
2010
IEEE
171views Hardware» more  DSD 2010»
13 years 6 months ago
Test Patterns Compression Technique Based on a Dedicated SAT-Based ATPG
— In this paper we propose a new method of test patterns compression based on a design of a dedicated SAT-based ATPG (Automatic Test Pattern Generator). This compression method i...
Jiri Balcarek, Petr Fiser, Jan Schmidt