2950 search results - page 473 / 590 » Computing with Infinitely Many Processes |
159
Voted
VLSID
2009
IEEE
16 years 3 months ago
2009
IEEE
Many system-level design tasks (e.g. timing analysis, hardware/software partitioning and design space exploration) involve computational kernels that are intractable (usually NP-ha...
126
click to vote
HPDC
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we describe the integration of dynamic right-sizing — an automatic and scalable buffer management technique for enhancing TCP performance — into GridFTP, a sub...
160
click to vote
PODS
1994
ACM
15 years 6 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
124
Voted
BMCBI
2007
15 years 2 months ago
2007
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
126
Voted
JCB
2006
15 years 2 months ago
2006
We develop a model for elucidating the assembly pathways by which an icosahedral viral shell forms from 60 identical constituent protein monomers. This poorly understood process a...