We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...
It is shown that the oorplan area minimization problem can be formulated as a convex programming problem with the numbers of variables and constraints signi cantly less than those...
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...
- This paper presents an approach to obtain reduced hardware and/or delay for synthesizing logic functions using multiplexers. Replication of single control line multiplexer is use...
Rekha K. James, T. K. Shahana, K. Poulose Jacob, S...
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...