Sciweavers

2356 search results - page 5 / 472
» Characterizations of postman sets
Sort
View
LPNMR
2007
Springer
14 years 1 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
SCHEDULING
2010
116views more  SCHEDULING 2010»
13 years 5 months ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff
SECURWARE
2008
IEEE
14 years 1 months ago
Polynomial Heuristic Algorithms for Inconsistency Characterization in Firewall Rule Sets
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACLs could have inconsistencies, allowing traffic that should be denied o...
Sergio Pozo Hidalgo, Rafael Ceballos, Rafael M. Ga...
ISCAS
2005
IEEE
121views Hardware» more  ISCAS 2005»
14 years 1 months ago
SET and RESET pulse characterization in BJT-selected phase-change memories
- This paper presents program pulse characterization in an 8-Mb BJT-selected Phase-Change Memory test chip. Experimental results of the impact of the bit-line resistance over progr...
Ferdinando Bedeschi, Edoardo Bonizzoni, Giulio Cas...
CSR
2009
Springer
13 years 10 months ago
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
Olaf Beyersdorff, Zenon Sadowski