Sciweavers

2214 search results - page 210 / 443
» Complexity of Reasoning
Sort
View
ICTAI
2008
IEEE
15 years 10 months ago
Let the Solver Deal with Redundancy
Handling redundancy in propositional reasoning and search is an active path of theoretical research. For instance, the complexity of some redundancy-related problems for CNF formu...
Cédric Piette
SEMCO
2007
IEEE
15 years 10 months ago
Semantic annotation and retrieval of video events using multimedia ontologies
Effective usage of multimedia digital libraries has to deal with the problem of building efficient content annotation and retrieval tools. In this paper Multimedia Ontologies, th...
Andrew D. Bagdanov, Marco Bertini, Alberto Del Bim...
CD
2005
Springer
15 years 9 months ago
Modelling Deployment Using Feature Descriptions and State Models for Component-Based Software Product Families
Abstract. Products within a product family are composed of different component configurations where components have different variable features and a large amount of dependency re...
Slinger Jansen, Sjaak Brinkkemper
ICFP
2008
ACM
16 years 3 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
CORR
2006
Springer
116views Education» more  CORR 2006»
15 years 3 months ago
Memory Aware High-Level Synthesis for Embedded Systems
We introduce a new approach to take into account the memory architecture and the memory mapping in the High- Level Synthesis of Real-Time embedded systems. We formalize the memory...
Gwenolé Corre, Eric Senn, Nathalie Julien, ...