Sciweavers

229 search results - page 43 / 46
» Bilateral Algorithms for Symbolic Abstraction
Sort
View
ATVA
2006
Springer
114views Hardware» more  ATVA 2006»
13 years 11 months ago
Selective Approaches for Solving Weak Games
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...
Malte Helmert, Robert Mattmüller, Sven Schewe
ECAI
2010
Springer
13 years 8 months ago
On the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs
Abstract. The agent programming language GOLOG and the underlying Situation Calculus have become popular means for the modelling and control of autonomous agents such as mobile rob...
Jens Claßen, Gerhard Lakemeyer
TEC
2008
104views more  TEC 2008»
13 years 7 months ago
Coevolution of Fitness Predictors
Abstract--We present an algorithm that coevolves fitness predictors, optimized for the solution population, which reduce fitness evaluation cost and frequency, while maintaining ev...
Michael D. Schmidt, Hod Lipson
IS
2010
13 years 5 months ago
Building concepts for AI agents using information theoretic Co-clustering
Abstract--High level conceptual thought seems to be at the basis of the impressive human cognitive ability, and AI researchers aim to replicate this ability in artificial agents. C...
Jason R. Chen
ICST
2009
IEEE
13 years 5 months ago
Proving Functional Equivalence of Two AES Implementations Using Bounded Model Checking
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
Hendrik Post, Carsten Sinz