Sciweavers

116 search results - page 4 / 24
» Automatic Abstraction for Intervals Using Boolean Formulae
Sort
View
ECAI
2006
Springer
15 years 5 months ago
Boolean Games Revisited
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
Elise Bonzon, Marie-Christine Lagasquie-Schiex, J&...
108
Voted
DATE
2004
IEEE
184views Hardware» more  DATE 2004»
15 years 5 months ago
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
We show how to automatically verify that complex XScale-like pipelined machine models satisfy the same safety and liveness properties as their corresponding instruction set archit...
Panagiotis Manolios, Sudarshan K. Srinivasan
CADE
2002
Springer
16 years 2 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
FOCI
2007
IEEE
15 years 8 months ago
Cardinality, Fuzziness, Variance and Skewness of Interval Type-2 Fuzzy Sets
Abstract— Centroid, cardinality, fuzziness, variance and skewness are all important concepts for an interval type-2 fuzzy set (IT2 FS) because they are all measures of uncertaint...
Jerry M. Mendel, Dongrui Wu
94
Voted
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 7 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins