Sciweavers

3134 search results - page 381 / 627
» Computing full disjunctions
Sort
View
118
Voted
IJPP
2010
156views more  IJPP 2010»
14 years 10 months ago
ForestGOMP: An Efficient OpenMP Environment for NUMA Architectures
Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform ar...
François Broquedis, Nathalie Furmento, Bric...
103
Voted
ADC
2010
Springer
210views Database» more  ADC 2010»
14 years 7 months ago
Towards unifying advances in twig join algorithms
Twig joins are key building blocks in current XML indexing systems, and numerous algorithms and useful data structures have been introduced. We give a structured, qualitative anal...
Nils Grimsmo, Truls Amundsen Bjørklund
CORR
2011
Springer
135views Education» more  CORR 2011»
14 years 7 months ago
Planning with Partial Preference Models
In many real-world planning scenarios, the users are interested in optimizing multiple objectives (such as makespan and execution cost), but are unable to express their exact trad...
Tuan A. Nguyen, Minh Binh Do, Alfonso Gerevini, Iv...
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 7 months ago
Left invertibility of discrete-time output-quantized systems: the linear case with finite inputs
This paper studies left invertibility of discrete-time linear output-quantized systems. Quantized outputs are generated according to a given partition of the state-space, while inp...
Nevio Dubbini, Benedetto Piccoli, Antonio Bicchi
155
Voted
SEMWEB
2010
Springer
14 years 7 months ago
Theoretical foundations and engineering tools for building ontologies as reference conceptual models
Abstract. Perhaps the most fundamental notion underlying the desiderata for a successful Semantic Web is Semantic Interoperability. In this context, ontologies have been more and m...
Giancarlo Guizzardi