2412 search results - page 275 / 483 » Which Problems Have Strongly Exponential Complexity |
138
Voted
CAINE
2008
15 years 5 months ago
2008
Assembly is an NP-Hard problem, which involves comparing fragments that have a time complexity of O(n2 ). This paper presents a parallel approach for sequence assembly. The parall...
156
Voted
CONSTRAINTS
2008
15 years 3 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
156
Voted
JODS
2006
15 years 3 months ago
2006
We introduce a novel view on how to deal with the problems of semantic interoperability in distributed systems. This view is based on the concept of emergent semantics, which sees ...
116
Voted
JOT
2007
15 years 3 months ago
2007
Design patterns represent solutions to specific problem of developing one application that have evolved over time. They leverage the reuse level to the design phase by providing a...
137
Voted
FGCS
2000
15 years 3 months ago
2000
Ant colonies, and more generally social insect societies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organiz...