? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
—The choices made by user in processing a set of documents is related, in a broad sense, to the sum of influences coming from the documents in the user situation, which does not...
Abstract. We quantify the local information dynamics at each spatiotemporal point in a complex system in terms of each element of computation: information storage, transfer and mod...
Joseph T. Lizier, Mikhail Prokopenko, Albert Y. Zo...
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
We propose an extension of Constraint Handling Rules (CHR) with aggregates such as sum, count, findall, and min. This new feature significantly improves the conciseness and expres...