5090 search results - page 340 / 1018 » Constructing Strategies for Programming |
132
click to vote
TAP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Usage of combinatorial testing is wide spreading as an effective technique to reveal unintended feature interaction inside a given system. To this aim, test cases are con...
148
click to vote
MFCS
2010
Springer
15 years 3 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
328
click to vote
ICDE
2005
IEEE
16 years 6 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...
154
click to vote
DCOSS
2006
Springer
15 years 8 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...
141
click to vote
LICS
1997
IEEE
15 years 8 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 ...