8825 search results - page 209 / 1765 » All for one or one for all |
126
click to vote
SIGOPSE
1996
ACM
15 years 5 months ago
1996
ACM
The one issue that unites almost all approaches to distributed computing is the need to know whether certain components in the system have failed or are otherwise unavailable. Whe...
104
click to vote
ISMVL
1994
IEEE
15 years 5 months ago
1994
IEEE
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
115
click to vote
COLT
1994
Springer
15 years 5 months ago
1994
Springer
Realistic domains for learning possess regularities that make it possible to generalize experience across related states. This paper explores an environment-modeling framework tha...
108
click to vote
STACS
1993
Springer
15 years 5 months ago
1993
Springer
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
CONEXT
2007
ACM
15 years 5 months ago
2007
ACM
Application and desktop sharing allows sharing any application with one or more people over the Internet. The participants receive the screen-view of the shared application from t...