Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
The optimal settings of retrieval parameters often depend on both the document collection and the query, and are usually found through empirical tuning. In this paper, we propose ...