258 search results - page 52 / 52 » New Lower Bounds for Heilbronn Numbers |
STOC
1993
ACM
13 years 9 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
EMSOFT
2009
Springer
13 years 8 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
ALMOB
2008
13 years 5 months ago
2008
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...