# deterministic algorithm

Also found in: Wikipedia.

## deterministic algorithm

[də‚tər·mə′nis·tik ′al·gə‚rith·əm]
(computer science)
Mentioned in ?
References in periodicals archive ?
Frattolillo, "A Deterministic Algorithm for the Deployment of Wireless Sensor Networks", International Journal of Communication Networks and Information Security, Vol.
Table 1 shows the results of the constructive deterministic algorithm.
For the aforementioned restricted scenario, we provide a deterministic algorithm finding a maximum clique in O ([[absolute value of E(G)].
Our algorithms compare favorably with the result of Ghosh et al [GSBG07]: The deterministic algorithm is faster than the algorithm in [GSBG07] when G is sparse, i.
In deterministic algorithm, number of tasks, number of processors, execution time of each task on the processors, and communication time between the tasks that are known at compiled time.
One alternative for this is to use, simultaneously, a deterministic algorithm.
It is a deterministic algorithm which takes as input a secret key sk, a message-signature pair (m, [sigma]), and common parameters, generates the individual receipt r.
Decrypt This is a deterministic algorithm consist of two steps.
Unsigncryption (USC) - is a deterministic algorithm.
The deterministic algorithm used to find the optimal solution, but its complexity is exponential order, and it takes a lot of memory space and it requires a very high computation time.
Since any PRNG that runs on a deterministic computer is a deterministic algorithm, the generated string will have certain characteristics that a string of natural random number does not have.
We present a deterministic algorithm that computes st-connectivity in undirected graphs using O([log.

Site: Follow: Share:
Open / Close