10890 search results - page 378 / 2178 » Automatic Complexity Analysis |
175
click to vote
CICLING
2003
Springer
15 years 12 months ago
2003
Springer
In setting up a formal system to specify a grammar formalism, the conventional (mathematical) wisdom is to start with primitives (basic primitive structures) as simple as possible...
180
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
188
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
210
Voted
EM
2010
15 years 6 months ago
2010
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
185
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: The identification of patterns in biological sequences is a key challenge in genome analysis and in proteomics. Frequently such patterns are complex and highly variabl...