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...
In formal approaches to commonsense reasoning about actions. the Ramification Problem denotes the problem of handling indirect effects which implicitly derive from so-called state...
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
The past decade has seen the development of a perspective holding that technology is socially constructed (Mackenzie and Wacjman, 1985; Bijker, Hughes and Pinch, 1987; Bijker and L...
We describe simple one-dimensional models of passive (no energy input, no control), generally dissipative, vertical hopping and oneball juggling. The central observation is that i...
Anindya Chatterjee, R. Pratap, C. K. Reddy, Andy R...