Sciweavers

147 search results - page 7 / 30
» The Computational Complexity of Quantified Reciprocals
Sort
View
ICAI
2009
14 years 7 months ago
An Alternative Representation for QBF
Quantified Boolean formulas are a powerful representation that have been used to capture and solve a variety of problems in Artificial Intelligence. While most research has focused...
Anja Remshagen, Klaus Truemper
IJAC
2010
231views more  IJAC 2010»
14 years 6 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa
ICASSP
2011
IEEE
14 years 1 months ago
Time-lagged Directed Information
Directed Information (DI) has recently been introduced to quantify the causality between two signals. However, one major remaining issue with DI is the computational complexity wh...
Ying Liu, Selin Aviyente
AISC
2006
Springer
15 years 1 months ago
An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
Songxin Liang, David J. Jeffrey
66
Voted
SIGOPSE
2004
ACM
15 years 3 months ago
An approach to benchmarking configuration complexity
Configuration is the process whereby components are assembled or adjusted to produce a functional system that operates at a specified level of performance. Today, the complexity o...
Aaron B. Brown, Joseph L. Hellerstein