Sciweavers

2412 search results - page 76 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
140
Voted
RECOMB
2006
Springer
16 years 2 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
150
Voted
DAM
2002
67views more  DAM 2002»
15 years 2 months ago
Optimal arrangement of data in a tree directory
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
Malwina J. Luczak, Steven D. Noble
122
Voted
ECMDAFA
2005
Springer
122views Hardware» more  ECMDAFA 2005»
15 years 8 months ago
Semantic Anchoring with Model Transformations
Model-Integrated Computing (MIC) is an approach to Model-Driven Architecture (MDA), which has been developed primarily for embedded systems. MIC places strong emphasis on the use o...
Kai Chen 0003, Janos Sztipanovits, Sherif Abdelwah...
149
Voted
ACRI
2010
Springer
15 years 1 months ago
The Complexity of Three-Dimensional Critical Avalanches
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
Carolina Mejía, J. Andrés Montoya
ECAI
2008
Springer
15 years 4 months ago
Towards Efficient Belief Update for Planning-Based Web Service Composition
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
Jörg Hoffmann