Sciweavers

2899 search results - page 550 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
WWW
2008
ACM
16 years 2 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen
LCTRTS
2010
Springer
15 years 8 months ago
Operation and data mapping for CGRAs with multi-bank memory
Coarse Grain Reconfigurable Architectures (CGRAs) promise high performance at high power efficiency. They fulfil this promise by keeping the hardware extremely simple, and movi...
Yongjoo Kim, Jongeun Lee, Aviral Shrivastava, Yunh...
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
15 years 8 months ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
Rahul Jain, Hartmut Klauck
ICS
2007
Tsinghua U.
15 years 7 months ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
DLOG
2004
15 years 2 months ago
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...