We introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. An example of such an association might be...
We present a simple approach for planning the motion of nonholonomic robots among obstacles. Existing methods lead to open-loop solutions which are either obtained in two stages, ...
Synchronization primitives for large shared-memory multiprocessors need to minimize latency and contention. Software queue-based locks address these goals, but suffer if a process...
Robert W. Wisniewski, Leonidas I. Kontothanassis, ...
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
The key to realistic self-applicable partial evaluation is to analyze binding times in the source program, i.e., whether the result of partially evaluating a source expression is ...