Sciweavers

1686 search results - page 280 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ATAL
2010
Springer
15 years 1 months ago
Optimal social laws
Social laws have proved to be a powerful and theoretically elegant framework for coordination in multi-agent systems. Most existing models of social laws assume that a designer is...
Thomas Ågotnes, Michael Wooldridge
86
Voted
BMCBI
2008
135views more  BMCBI 2008»
15 years 26 days ago
Fregene: Simulation of realistic sequence-level data in populations and ascertained samples
Background: FREGENE simulates sequence-level data over large genomic regions in large populations. Because, unlike coalescent simulators, it works forwards through time, it allows...
Marc Chadeau-Hyam, Clive J. Hoggart, Paul F. O'Rei...
BMCBI
2005
306views more  BMCBI 2005»
15 years 20 days ago
A method for aligning RNA secondary structures and its application to RNA motif detection
Background: Alignment of RNA secondary structures is important in studying functional RNA motifs. In recent years, much progress has been made in RNA motif finding and structure a...
Jianghui Liu, Jason Tsong-Li Wang, Jun Hu, Bin Tia...
110
Voted
PPOPP
2010
ACM
15 years 10 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...
110
Voted
EMSOFT
2004
Springer
15 years 6 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross