Sciweavers

1717 search results - page 226 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
PODC
2009
ACM
15 years 4 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
INFOCOM
2009
IEEE
15 years 4 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
BMCBI
2007
135views more  BMCBI 2007»
14 years 10 months ago
Detecting multivariate differentially expressed genes
Background: Gene expression is governed by complex networks, and differences in expression patterns between distinct biological conditions may therefore be complex and multivariat...
Roland Nilsson, José M. Peña, Johan ...
BMCBI
2010
176views more  BMCBI 2010»
14 years 7 months ago
Haplotype association analyses in resources of mixed structure using Monte Carlo testing
Background: Genomewide association studies have resulted in a great many genomic regions that are likely to harbor disease genes. Thorough interrogation of these specific regions ...
Ryan Abo, Jathine Wong, Alun Thomas, Nicola J. Cam...
SIGSOFT
2008
ACM
15 years 10 months ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren