Sciweavers

87 search results - page 12 / 18
» Limits of dense graph sequences
Sort
View
AAAI
2007
14 years 12 months ago
Allocating Goods on a Graph to Eliminate Envy
We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A gr...
Yann Chevaleyre, Ulrich Endriss, Nicolas Maudet
BMCBI
2010
183views more  BMCBI 2010»
14 years 9 months ago
SOPRA: Scaffolding algorithm for paired reads via statistical optimization
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
Adel Dayarian, Todd P. Michael, Anirvan M. Sengupt...
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 4 months ago
Network Estimation and Packet Delivery Prediction for Control over Wireless Mesh Networks
: Much of the current theory of networked control systems uses simple point-to-point communiodels as an abstraction of the underlying network. As a result, the controller has very ...
Phoebus Chen, Chithrupa Ramesh, Karl Henrik Johans...
ALMOB
2006
109views more  ALMOB 2006»
14 years 9 months ago
A novel functional module detection algorithm for protein-protein interaction networks
Background: The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically eva...
Woochang Hwang, Young-Rae Cho, Aidong Zhang, Mural...
CN
1999
100views more  CN 1999»
14 years 9 months ago
Testing protocols modeled as FSMs with timing parameters
An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active t...
M. Ümit Uyar, Mariusz A. Fecko, Adarshpal S. ...