446 search results - page 79 / 90 » On the Interactive Complexity of Graph Reliability |
IJCAI
1989
13 years 9 months ago
1989
t ion which is much more abstract than a place vocabulary, the kinematic topology. Kinematic topology does not define qualitative inference rules, but provides a characterization o...
MOBICOM
2003
ACM
14 years 1 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
SIGSOFT
2010
ACM
13 years 5 months ago
2010
ACM
A replay tool aiming to reproduce a program's execution interposes itself at an appropriate replay interface between the program and the environment. During recording, it log...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
COCO
1994
Springer
13 years 12 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...