This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...
Jason M. Daida, Michael E. Samples, Matthew J. Byo...
On the evening of 2 November 1988, someone “infected” the Internet with a worm program. That program exploited flaws in utility programs in systems based on BSD-derived versi...
Long transactions cause pragmatic problems for workflow systems – as the transaction is moving, so is the surrounding world. We look at three scenarios in which external events ...
Location-based ubiquitous computing systems are entering mainstream society and becoming familiar parts of everyday life. However, the settings in which they are deployed are alre...
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of m...