1157 search results - page 81 / 232 » Descriptive Complexity and Model Checking |
IEAAIE
1999
Springer
15 years 2 months ago
1999
Springer
This paper describes the use of cases as a process representation technique and shows how case base reasoning can be used to navigate through, or execute a complex control process....
ICCD
1995
IEEE
15 years 1 months ago
1995
IEEE
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
IJCNN
2008
IEEE
15 years 4 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...
117
click to vote
BMCBI
2010
14 years 10 months ago
2010
Background: Several diseases, many of which nowadays pandemic, consist of multifactorial pathologies. Paradigmatic examples come from the immune response to pathogens, in which ca...
115
click to vote
PODS
1994
ACM
15 years 1 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...