8496 search results - page 247 / 1700 » Problem Solving and Complex Systems |
164
click to vote
COCO
2005
Springer
16 years 3 days ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
178
click to vote
FORMATS
2008
Springer
15 years 8 months ago
2008
Springer
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
183
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
153
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
220
click to vote
WADS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...