1058 search results - page 192 / 212 » It's Doomed; We Can Prove It |
ECCC
2007
13 years 9 months ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
JACM
2007
13 years 9 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
DEDS
2002
13 years 9 months ago
2002
Abstract. Detection and isolation of failures in large and complex systems such as telecommunication networks are crucial and challenging tasks. The problem considered here is that...
NDJFL
1998
13 years 9 months ago
1998
We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer...
CASES
2004
ACM
14 years 3 months ago
2004
ACM
+ With more applications being deployed on embedded platforms, software protection becomes increasingly important. This problem is crucial on embedded systems like financial transa...