14379 search results - page 2845 / 2876 » is 2000 |
JACM
2000
14 years 10 months ago
2000
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
JACM
2000
14 years 10 months ago
2000
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
JAIR
2000
14 years 10 months ago
2000
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
JAIR
2000
14 years 10 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
110
click to vote
JAR
2000
14 years 10 months ago
2000
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...