Sciweavers

2018 search results - page 122 / 404
» Code Normal Forms
Sort
View
SAT
2009
Springer
94views Hardware» more  SAT 2009»
15 years 9 months ago
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
In this paper we consider the class of boolean formulas in Conjunctive Normal Form (CNF) where for each variable all but at most d occurrences are either positive or negative. This...
Daniel Johannsen, Igor Razgon, Magnus Wahlströ...
ICASSP
2008
IEEE
15 years 9 months ago
Impact of mismatched statistics on correlated MIMO capacity
Many recent works that study the impact of spatial correlation on the performance of multi-input multi-output (MIMO) systems assume a separable (also known as the Kronecker) model...
Vasanthan Raghavan, Akbar M. Sayeed, Jayesh H. Kot...
121
Voted
FOCI
2007
IEEE
15 years 8 months ago
Almost All Learning Machines are Singular
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
Sumio Watanabe
EPIA
2005
Springer
15 years 8 months ago
Logical Implementation of Uncertain Agents
Abstract. We consider the representation and execution of agents specified using temporal logics. Previous work in this area has provided a basis for the direct execution of agent...
Nivea de Carvalho Ferreira, Michael Fisher, Wiebe ...
LATA
2010
Springer
15 years 7 months ago
Simplifying Regular Expressions. A Quantitative Perspective
Abstract. We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we...
Hermann Gruber and Stefan Gulan