Sciweavers

1278 search results - page 150 / 256
» The Complexity of Weighted Boolean
Sort
View
AAAI
2006
13 years 11 months ago
The Impact of Balancing on Problem Hardness in a Highly Structured Domain
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
Carlos Ansótegui, Ramón Béjar...
SLP
1994
77views more  SLP 1994»
13 years 11 months ago
Modal Event Calculus
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
ESORICS
2010
Springer
13 years 11 months ago
On Bounding Problems of Quantitative Information Flow
Abstract. Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the gue...
Hirotoshi Yasuoka, Tachio Terauchi
GLVLSI
2008
IEEE
150views VLSI» more  GLVLSI 2008»
13 years 10 months ago
Using unsatisfiable cores to debug multiple design errors
Due to the increasing complexity of today's circuits a high degree of automation in the design process is mandatory. The detection of faults and design errors is supported qu...
André Sülflow, Görschwin Fey, Rod...
ENTCS
2008
175views more  ENTCS 2008»
13 years 10 months ago
AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System
A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, programming a...
Cezara Dragoi, Gheorghe Stefanescu