We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
This paper describes a heuristics-based system for automatic measurement of syntactic complexity using the revised Developmental Level (D-Level) Scale (Rosenberg and Abbeduto, 198...
This paper proposes a novel architecture synthesis algorithm for single-loop single-bit ∆Σ modulators. We defined a generic modulator architecture and derived its noise and si...
Abstract. A common way of dealing with the paradoxes of preference aggregation consists in restricting the domain of admissible preferences. The most well-known such restriction is...