Sciweavers

6142 search results - page 400 / 1229
» The Complexity of Partition Functions
Sort
View
BMCBI
2007
114views more  BMCBI 2007»
15 years 6 months ago
Combination of scoring schemes for protein docking
Background: Docking algorithms are developed to predict in which orientation two proteins are likely to bind under natural conditions. The currently used methods usually consist o...
Philipp Heuser, Dietmar Schomburg
INFOCOM
2010
IEEE
15 years 5 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran
CEC
2005
IEEE
16 years 11 days ago
Formation of modules in a computational model of embryogeny
An investigation is conducted into the effects of a complex mapping between genotype and phenotype upon a simulated evolutionary process. A model of embryogeny is utilised to grow ...
Chris P. Bowers
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
16 years 5 days ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
ASPDAC
2001
ACM
94views Hardware» more  ASPDAC 2001»
15 years 10 months ago
On speeding up extended finite state machines using catalyst circuitry
We propose a timing optimization technique for a complex finite state machine that consists of not only random logic but also data operators. In such a design, the timing critical...
Shi-Yu Huang