Sciweavers

1941 search results - page 248 / 389
» On the Hardness of Approximate Reasoning
Sort
View
ECBS
2011
IEEE
271views Hardware» more  ECBS 2011»
14 years 6 months ago
MoPED: A Model-Based Provisioning Engine for Dependability in Component-Based Distributed Real-Time Embedded Systems
—Developing dependable distributed real-time and embedded (DRE) systems incurs significant complexities in the tradeoffs resulting from the different conflicting attributes of ...
Sumant Tambe, Akshay Dabholkar, Aniruddha S. Gokha...
DAC
2007
ACM
16 years 7 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne
CIE
2007
Springer
16 years 17 days ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
SEMWEB
2007
Springer
16 years 15 days ago
Lightweight Community-Driven Ontology Evolution
Only few well-maintained domain ontologies can be found on the Web. The likely reasons for the lack of useful domain ontologies include that (1) informal means to convey intended m...
Katharina Siorpaes
SASN
2006
ACM
16 years 10 days ago
Autonomous and distributed node recovery in wireless sensor networks
Intrusion or misbehaviour detection systems are an important and widely accepted security tool in computer and wireless sensor networks. Their aim is to detect misbehaving or faul...
Mario Strasser, Harald Vogt