Sciweavers

741 search results - page 134 / 149
» A Note on the Use of Independent Sets for the k-SAT Problem
Sort
View
BMCBI
2010
153views more  BMCBI 2010»
13 years 7 months ago
Metamotifs - a generative model for building families of nucleotide position weight matrices
Background: Development of high-throughput methods for measuring DNA interactions of transcription factors together with computational advances in short motif inference algorithms...
Matias Piipari, Thomas A. Down, Tim J. P. Hubbard
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 7 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
Broadcast Cooperation Strategies for Two Colocated Users
This work considers the problem of communication from a single transmitter, over a network with colocated users, through an independent block Rayleigh fading channel. The colocati...
Avi Steiner, Amichai Sanderovich, Shlomo Shamai
PLDI
2004
ACM
14 years 28 days ago
Min-cut program decomposition for thread-level speculation
With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, al...
Troy A. Johnson, Rudolf Eigenmann, T. N. Vijaykuma...
CLIMA
2007
13 years 9 months ago
Plan-Coordination Mechanisms and the Price of Autonomy
Abstract. Task-based planning problems for multi-agent systems require multiple agents to find a joint plan for a constrained set of tasks. Typically, each agent receives a subset...
J. Renze Steenhuisen, Cees Witteveen, Yingqian Zha...