Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates

By Das S.K.   Pinotti M.C.  

Journal of Parallel and Distributed Computing, Vol. 60, Iss. 8, 2000-08 ,pp. : 998-1027

Academic Press

Access to resources Recommend Favorite

Conflict-Free channel set assignment for an optical cluster interconnection network based on rotator digraphs

By Wan P.-J.  

Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. : 193-201

Elsevier

Access to resources Recommend Favorite

Evolutions in parallel distributed and network-based processing

By Clematis A.   D'Agostino D.  

Journal of Systems Architecture, Vol. 49, Iss. 10, 2003-11 ,pp. : 397-398

Elsevier

Access to resources Recommend Favorite

Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees

By Bertossi A.A.   Pinotti C.M.  

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 8, 2002-08 ,pp. : 1314-1333

Academic Press

Access to resources Recommend Favorite

A NEURAL NETWORK-BASED SYSTEM FOR PREDICTION OF COMPUTER USER COMFORT

By Seckiner Serap Ulusam  

Applied Artificial Intelligence, Vol. 23, Iss. 8, 2009-09 ,pp. : 781-803

Taylor & Francis Ltd

Access to resources Recommend Favorite