Sciweavers

16430 search results - page 801 / 3286
» On Computable Tree Functions
Sort
View
PODC
1990
ACM
15 years 11 months ago
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
Shlomi Dolev, Amos Israeli, Shlomo Moran
MOBIHOC
2012
ACM
13 years 10 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
BIOADIT
2004
Springer
16 years 28 days ago
Searching for a Practical Evidence of the No Free Lunch Theorems
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
Mihai Oltean
IPPS
2002
IEEE
16 years 14 days ago
High-Performance Parallel and Distributed Computing for the BMI Eigenvalue Problem
The BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel algorithm to co...
Kento Aida, Yoshiaki Futakata, Shinji Hara
BMCBI
2010
165views more  BMCBI 2010»
15 years 7 months ago
MTar: a computational microRNA target prediction architecture for human transcriptome
Background: MicroRNAs (miRNAs) play an essential task in gene regulatory networks by inhibiting the expression of target mRNAs. As their mRNA targets are genes involved in importa...
Vinod Chandra, Reshmi Girijadevi, Achuthsankar S. ...