Proposed Circuit for XOR Benchmark Problem
Quantum Algorithms for the k-xor Problem
... A quantum circuit is an abstract representation of a quantum algorithm running on a universal quantum computer. Given a number of qubits, put in an arbitrary initial state (say |0i), we apply a succession of ...
34
Area Efficient Three-Input XOR/XNOR Circuit
... of circuit components for the PDP goal, this brief has benefited ...three-input XOR/XNOR circuit with lower PDP and a smaller ...new circuit has a greater driving capability, a higher ...
6
Design of New Low Leakage Power Domino XOR Circuit
... 3. PROPOSED XOR CIRCUIT P-type domino XOR effectively suppresses both subthreshold and gate oxide leakage current because of higher barrier height for holes tunneling from conduction band in ...
5
Two Solutions to the XOR Problem using minimum configuration MLP
... the XOR problem, which is a non-linearly separable ...the XOR problem using Minimum Configuration Multilayer Perceptron MLP is ...solution proposed is different to what author did in ...
5
New Benchmark Instances for the Staff Rostering Problem
... scheduling, benchmark instances, PEAST algorithm ...consuming problem that every company or institution that has employees working on shifts or on irregular working days must ...scheduling problem ...
5
Analysis of Conventional CMOS and FinFET based 6 T XOR XNOR Circuit at 45nm Technology
... for XOR and XNOR circuits is suggested to improve the speed and ...based XOR-XNOR circuit ...in XOR-XNOR digital circuits. The proposed FinFET based XOR and XNOR circuits have ...
6
A concurrent error detection based fault-tolerant 32 nm XOR-XNOR circuit implementation
... major problem of process variations. This problem makes designing VLSI circuits harder and harder, affects the circuit performance and introduces faults that can cause critical ...Since ...
5
A New Heuristic for the Hamiltonian Circuit Problem
... First and foremost discovery of an algorithm for the knight’s tour problem was by H.C. Warnsdorff in 1823. Like other mathematicians, Warnsdorff described the knight’s tour as a mathematical puzzle. Later it was ...
107
Local search algorithms based on benchmark test functions problem
... the proposed GD and SA algorithms, using an ensemble of expansively employed unimodal and multimodal standard benchmark ...standard benchmark functions that have been expansively employed in past ...
6
Merton’s problem for an investor with a benchmark in a Barndorff-Nielsen and Shephard market
... been proposed for making optimal investment ...the problem of optimal allocation of a portfolio in order to maximize the expected utility of wealth in a Black Scholes ...
20
On the Security of the Free-XOR Technique
... boolean circuit. In Yao’s original construction, each gate in the circuit requires the parties to perform a constant number of encryptions/decryptions, and to send/receive a constant number of ...2008) ...
14
An Innovative Genetic Algorithm for the Quantum Circuit Compilation Problem
... The problem tackled in this work consists in compiling a given quantum circuit on a specific quantum hardware ar- ...MaxCut problem (see below); (ii) a specific hardware architecture inspired by the ...
8
Test the S27 Benchmark Circuit by Using Built In Self Test and Test Pattern Generation
... the proposed method we are test the S27 sequential circuit by using Built in Self ...the circuit to produce additional reachable ...a circuit traverses only reachable states in the functional ...
9
ALU, CMOS, GDI, XOR, XNOR.
... logic circuit (ALU) by the concept of Gate Diffusion Input (GDI) ...design proposed ALU is better than CMOS ALU around the power savings was between 20 to ...The proposed ALU shows that it is better ...
7
Solving the Linearly Inseparable XOR Problem with Spiking Neural Networks
... As XOR is considered one of the most challenging Boolean logic functions, we chose the AND function as the starting point for testing the possibility of creating a network of spiking neurons to perform logic gate ...
6
A proposed modified text steganography technique using UniSpaCh with XOR encryption and shift cipher
... Our proposed technique still gives the same embedding capacity that original UniSpaCh has, and also ensure more secure and robustness because the encryption process done prior on embedding message to the cover ...
6
Evaluation of RAPID for a UNF cask benchmark problem
... Evaluation of RAPID for a UNF cask benchmark problem Valerio Mascolino 1 , a , Alireza Haghighat 1 , b , and Nathan J. Roskoff 1 , c 1 Nuclear Science & Engineering Lab (NSEL), Virginia Tech, 900 N Glebe ...
10
1-Bit Full Adder Circuit using XOR-XNOR Cells with Power and Area Optimization
... Keywords: Low power; Area Efficent; Full Adder; GDI; Multiplexers Introduction The battery driven and portable devices are demand of current industry application which needs an implementation of low power and area ...
7
Proposed Approach to the Job Inspection of Civil Service Benchmark Jobs
... of benchmark jobs (Cont’d) z Phase One Consultant has recommended that civil service jobs in the education, medical & health care and social welfare fields should not be included as benchmark jobs because ...
25
FleXOR: Flexible garbling for XOR gates that beats free-XOR
... Then, we point out that the code of G 2 does not need to use the v i values, except when i is an output wire. For all other wires, the value v k is only used to set b ∗ k := b k ⊕ v k . But for non-XOR gates, b k ...
24