Sciweavers

13457 search results - page 131 / 2692
» Can we elect if we cannot compare
Sort
View
BMCBI
2007
104views more  BMCBI 2007»
13 years 9 months ago
A response to Yu et al. "A forward-backward fragment assembling algorithm for the identification of genomic amplification and de
Background: Yu et al. (BMC Bioinformatics 2007,8: 145+) have recently compared the performance of several methods for the detection of genomic amplification and deletion breakpoin...
Oscar M. Rueda, Ramón Díaz-Uriarte
SIGCOMM
2009
ACM
14 years 3 months ago
SMACK: a SMart ACKnowledgment scheme for broadcast messages in wireless networks
Network protocol designers, both at the physical and network level, have long considered interference and simultaneous transmission in wireless protocols as a problem to be avoide...
Aveek Dutta, Dola Saha, Dirk Grunwald, Douglas C. ...
SPAA
2009
ACM
14 years 9 months ago
On avoiding spare aborts in transactional memory
This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, co...
Idit Keidar, Dmitri Perelman
ICTAC
2007
Springer
14 years 3 months ago
On the Expressive Power of QLTL
LTL cannot express the whole class of ω-regular languages and several extensions have been proposed. Among them, Quantified propositional Linear Temporal Logic (QLTL), proposed b...
Zhilin Wu
CAV
2005
Springer
127views Hardware» more  CAV 2005»
14 years 2 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala