Embedded vision systems buffer minimization with energy consumption constraint

In order to simplify the process of converting numbers from the modular representation to the positional representation of numbers, we will consider an approximate method that allows

In Section 3, we present an algorithm for the problem of minimizing the total number of communications in the UET-bound model, for the special case of a tree and an unlimited number

The Domino problem is the following decision problem: given a finite set of Wang tiles, decide whether it admits a tiling.. Theorem 1

In the present work, we define the prob- lem called the Minimum Receiver Problem (MRP) consisting in finding the minimum number of receivers needed for a given traffic matrix in

This paper introduces a generalization of the nvalue con- straint that bounds the number of distinct values taken by a set of vari- ables.The generalized constraint (called

We considered the possibility that there was only very weak molecular correlation along the texture axis (a classical nematic) so that the observed meridional arcs could be

rotation number should be related to the topological notion of index, at any rate for normal curves.. The object of the

Guohua and Benjamin [13] consider a single machine scheduling problem with dual cri- teria, i.e., the minimization of the total weighted earliness subject to minimum number of