3690 search results - page 303 / 738 » Computation with classical sequents |
175
click to vote
MOBIHOC
2000
ACM
15 years 9 months ago
2000
ACM
— This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic routing (DDR)....
149
click to vote
STOC
2000
ACM
15 years 9 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
153
click to vote
CL
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simul...
134
click to vote
EICS
2010
ACM
15 years 9 months ago
2010
ACM
UI model discovery is a lightweight formal method in which a model of an interactive system is automatically discovered by exploring the system’s state space, simulating the act...
145
click to vote
FCT
1999
Springer
15 years 9 months ago
1999
Springer
Local event structures and local traces are generalizations of the classical prime event structures and Mazurkiewicz’ traces in which independence is no longer a global binary pr...