Sciweavers

7853 search results - page 1542 / 1571
» Learning from Each Other
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 23 days ago
Random Debaters and the Hardness of Approximating Stochastic Functions
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 ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
FSTTCS
1993
Springer
14 years 22 days ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
EDCC
1994
Springer
14 years 22 days ago
Designing Secure and Reliable Applications using Fragmentation-Redundancy-Scattering: An Object-Oriented Approach
Security and reliability issues in distributed systems have been investigated for several years at LAAS using a technique called Fragmentation-Redundancy-Scattering (FRS). The aim ...
Jean-Charles Fabre, Yves Deswarte, Brian Randell
HT
1993
ACM
14 years 22 days ago
Designing Dexter-Based Cooperative Hypermedia Systems
This paper discusses issues for the design of a Dexter-based cooperative hypermedia architecture and a specific system, DeVise Hypermedia (DHM), developed from this architecture. ...
Kaj Grønbæk, Jens A. Hem, Ole Lehrman...
SIGCOMM
1994
ACM
14 years 22 days ago
Improved Algorithms for Synchronizing Computer Network Clocks
The Network Time Protocol (NTP) is widely deployed in the Internet to synchronize computer clocks to each other and to international standards via telephone modem, radio and satel...
David L. Mills
« Prev « First page 1542 / 1571 Last » Next »