Sciweavers

9370 search results - page 1776 / 1874
» An Abstract Notion of Application
Sort
View
CIE
2007
Springer
14 years 4 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
CIKM
2007
Springer
14 years 4 months ago
Ontology module extraction for ontology reuse: an ontology engineering perspective
Problems resulting from the management of shared, distributed knowledge has led to ontologies being employed as a solution, in order to effectively integrate information across a...
Paul Doran, Valentina A. M. Tamma, Luigi Iannone
COCOA
2007
Springer
14 years 4 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
ESWS
2007
Springer
14 years 4 months ago
Understanding Large Volumes of Interconnected Individuals by Visual Exploration
Abstract. Ontologies are now used within an increasing number of realworld applications. So far, significant effort has been spend in building tools to support users in creating,...
Olaf Noppens, Thorsten Liebig
FMICS
2007
Springer
14 years 4 months ago
An Approach to Formalization and Analysis of Message Passing Libraries
Message passing using libraries implementing the Message Passing Interface (MPI) standard is the dominant communication mechanism in high performance computing (HPC) applications. ...
Robert Palmer, Michael Delisi, Ganesh Gopalakrishn...
« Prev « First page 1776 / 1874 Last » Next »