2376 search results - page 29 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
TCBB
2008
13 years 7 months ago
2008
Two efficient and complementary sampling algorithms are presented to explore the space of closed clash-free conformations of a flexible protein loop. The "seed sampling" ...
IJDMB
2006
13 years 7 months ago
2006
: Most motif discovery algorithms from DNA sequences require the motif's length as input. Styczynski et al. introduced the Extended (l,d)-Motif Problem (EMP) where the motif&#...
IJIS
2008
13 years 7 months ago
2008
Linear-time computational techniques have been developed for combining evidence which is available on a number of contending hypotheses. They offer a means of making the computati...
JNW
2006
13 years 7 months ago
2006
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...
DAC
1996
ACM
13 years 11 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...