1569 search results - page 121 / 314 » Programming contest strategy |
107
Voted
POPL
1996
ACM
15 years 4 months ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
262
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
We study several transparent techniques for scaling dynamic content web sites, and we evaluate their relative impact when used in combination. Full transparency implies strong dat...
108
click to vote
DCOSS
2006
Springer
15 years 4 months ago
2006
Springer
We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing th...
LICS
1997
IEEE
15 years 4 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
178
Voted
WABI
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We present three heuristic strategies for folding RNA sequences into secondary structures including kissing hairpin motifs. The new idea is to construct a kissing hairpin...