Characterization of Combinatorially Independent Permutation Separability Criteria

By Wocjan Pawel   Horodecki Michal  

Open Systems and Information Dynamics, Vol. 12, Iss. 4, 2005-12 ,pp. : 331-345

Springer Publishing Company

Access to resources Recommend Favorite

Simulation of electron states in quantum wires with mixed finite elements

By Lepaul S   Bouillault F   Lustrac A De  

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 15, Iss. 3, 1996-03 ,pp. : 58-69

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms

By Shalev-Shwartz Shai  

Machine Learning, Vol. 80, Iss. 2-3, 2010-09 ,pp. : 141-163

Springer Publishing Company

Access to resources Recommend Favorite

Genetic algorithm for the permutation flow-shopscheduling problem with linear models of operations

By Janiak A.   Portmann M-C.  

Annals of Operations Research, Vol. 83, Iss. 1, 1998-01 ,pp. : 95-114

Springer Publishing Company

Access to resources Recommend Favorite

Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses

By Trahan J.L.   Bourgeois A.G.   Pan Y.   Vaidyanathan R.  

Journal of Parallel and Distributed Computing, Vol. 60, Iss. 9, 2000-09 ,pp. : 1125-1136

Academic Press

Access to resources Recommend Favorite