Sciweavers

210 search results - page 32 / 42
» Definability and automorphisms in abstract logics
Sort
View
TCAD
2002
145views more  TCAD 2002»
13 years 7 months ago
Automatic generation of synthetic sequential benchmark circuits
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil
EUSFLAT
2009
141views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
An Experimental Study on the Interpretability of Fuzzy Systems
Abstract-- Interpretability is one of the most significant properties of Fuzzy Systems which are widely acknowledged as gray boxes against other Soft Computing techniques such as N...
José M. Alonso, Luis Magdalena
KBSE
2000
IEEE
13 years 11 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
CADE
2009
Springer
14 years 8 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
IIWAS
2008
13 years 9 months ago
Using conditional transformations for semantic user interface adaptation
The rapid growth of mobile Internet use requires highly flexible and adaptable user interfaces for web applications. Contextual data from various sources as for example device HMI...
Pascal Bihler, Merlin Fotsing, Günter Kniesel...