Sciweavers

2905 search results - page 50 / 581
» Formal Memetic Algorithms
Sort
View
FLAIRS
2006
13 years 10 months ago
Formal Verification of Cognitive Models
Cognitive modeling has outgrown the toy problems of the research labs and is increasingly tackling Industrial size applications. This growth is not matched in terms of software to...
A. MacKlem, Fatma Mili
KR
1992
Springer
14 years 27 days ago
Embedding Defaults into Terminological Knowledge Representation Formalisms
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
Franz Baader, Bernhard Hollunder
FMCAD
2000
Springer
14 years 13 days ago
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
Roderick Bloem, Harold N. Gabow, Fabio Somenzi
JALC
2008
72views more  JALC 2008»
13 years 8 months ago
Maximal Error-Detecting Capabilities of Formal Languages
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
Stavros Konstantinidis, Pedro V. Silva
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
13 years 7 months ago
Formal Correctness Proof for DPLL Procedure
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veriï...
Filip Maric, Predrag Janicic