68 search results - page 8 / 14 » A Reach and Bound algorithm for acyclic dynamic-programming ... |
TCBB
2010
13 years 1 months ago
2010
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
INFOCOM
2005
IEEE
14 years 9 days ago
2005
IEEE
Abstract— Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would beneï¬...
IPPS
2010
IEEE
13 years 4 months ago
2010
IEEE
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
PODC
2004
ACM
14 years 4 days ago
2004
ACM
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
ISCI
2008
13 years 6 months ago
2008
Significant research has been devoted to aggregation in sensor networks with a view to optimize its performance. Existing research has mostly concentrated on maximizing network li...