Sciweavers

139 search results - page 2 / 28
» Modular difference logic is hard
Sort
View
DATE
2005
IEEE
128views Hardware» more  DATE 2005»
15 years 3 months ago
On the Optimal Design of Triple Modular Redundancy Logic for SRAM-based FPGAs
Triple Modular Redundancy (TMR) is a suitable fault tolerant technique for SRAM-based FPGA. However, one of the main challenges in achieving 100% robustness in designs protected b...
Fernanda Lima Kastensmidt, Luca Sterpone, Luigi Ca...
CLIMA
2008
14 years 11 months ago
Easy Yet Hard: Model Checking Strategies of Agents
Abstract. I present an overview of complexity results for model checking of temporal and strategic logics. Unfortunately, it is possible to manipulate the context so that different...
Wojciech Jamroga
ANOR
2010
123views more  ANOR 2010»
14 years 9 months ago
Nature inspired genetic algorithms for hard packing problems
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
Philipp Rohlfshagen, John A. Bullinaria
EMSOFT
2010
Springer
14 years 7 months ago
Resource adaptations with servers for hard real-time systems
Many real-time applications are designed to work in different operating modes each characterized by different functionality and resource demands. With each mode change, resource d...
Nikolay Stoimenov, Lothar Thiele, Luca Santinelli,...
KCAP
2009
ACM
15 years 2 months ago
An entropy inspired measure for evaluating ontology modularization
Ontology modularization has received growing interest from the research community lately, since it supports tasks such as ontology design/reuse and knowledge selection and integra...
Paul Doran, Valentina A. M. Tamma, Terry R. Payne,...