Sciweavers

415 search results - page 72 / 83
» time 1994
Sort
View
SLP
1994
77views more  SLP 1994»
13 years 11 months ago
Modal Event Calculus
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
USENIX
1994
13 years 11 months ago
Concert/C: A Language for Distributed Programming
Concert/C is a new language for distributed C programming that extends ANSI C to support distribution and process dynamics. Concert/C provides the ability to create and terminate ...
Joshua S. Auerbach, Arthur P. Goldberg, Germ&aacut...
USENIX
1994
13 years 11 months ago
Improving the Write Performance of an NFS Server
The Network File System (NFS) utilizes a stateless protocol between clients and servers; the major advantage of this statelessness is that NFS crash recovery is very easy. However...
Chet Juszczak
DBWORKSHOPS
1992
13 years 10 months ago
An Incremental Concept Formation Approach for Learning from Databases
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
Rokia Missaoui, Robert Godin
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
12 years 9 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...