Sciweavers

1022 search results - page 51 / 205
» Logspace Complexity of Functions and Structures
Sort
View
MST
2007
167views more  MST 2007»
13 years 9 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
BMCBI
2004
196views more  BMCBI 2004»
13 years 9 months ago
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
Background: In a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief summary of the algorithm and showing MUS...
Robert C. Edgar
EWSPT
2001
Springer
14 years 2 months ago
A Mobile Agent Approach to Process-Based Dynamic Adaptation of Complex Software Systems
We describe an approach based upon software process technology to on-the-fly monitoring, redeployment, reconfiguration, and in general dynamic adaptation of distributed software ap...
Giuseppe Valetto, Gail E. Kaiser, Gaurav S. Kc
BMCBI
2004
93views more  BMCBI 2004»
13 years 9 months ago
Predicting binding sites of hydrolase-inhibitor complexes by combining several methods
Background: Protein-protein interactions play a critical role in protein function. Completion of many genomes is being followed rapidly by major efforts to identify interacting pr...
Taner Z. Sen, Andrzej Kloczkowski, Robert L. Jerni...
AI
2010
Springer
13 years 9 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim