723 search results - page 17 / 145 » Reducing the complexity of the issue logic |
IJCNN
2008
IEEE
14 years 1 months ago
2008
IEEE
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...
CADE
2009
Springer
14 years 2 months ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
MapReduce is a computing paradigm that has gained a lot of popularity as it allows non-expert users to easily run complex analytical tasks at very large-scale. At such scale, task...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
ASP
2005
Springer
14 years 1 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...