FAQ

Mass Storage Control Protocol

Known as: MSCP, RQDX, UDA50 
The Mass Storage Control Protocol (MSCP) is a protocol that was designed by Digital Equipment Corporation of Maynard, Massachusetts for the purposes… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2018
0246819762018

Related topics

Related topics

6 relations
Central processing unitMass storageUltrixUnibus
(More)

Broader (1)

OpenVMS

Related mentions per year

Related mentions per year

1955-2018
1960198020002020
Mass Storage Control Protocol
Central processing unit
OpenVMS
Mass storage
Ultrix
VMScluster

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A memetic algorithm for the Minimum Sum Coloring Problem
Given an undirected graph G, the Minimum Sum Coloring Problem (MSCP) is to find a legal assignment of colors (represented by… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2013
2013
Improved Lower Bounds for Sum Coloring via Clique Decomposition
Given an undirected graph G = (V,E) with a set V of vertices and a set E of edges, the minimum sum coloring problem (MSCP) is to… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2013
2013
Solving the minimum sum coloring problem via binary quadratic programming
In recent years, binary quadratic programming (BQP) has been 7 successively applied to solve several combinatorial optimization… (More)
  • figure 1
  • table 1
  • table 2
Is this relevant?
2013
2013
Upper and Lower Bounds for the Minimum Sum Coloring Problem✩
  • Aziz Moukrima, Kaoutar Sghiouera, Corinne Lucetb, Yu Lib
  • 2013
In this paper we study upper and lower bounds of the Minimum Sum Coloring Problem (MSCP) from a uniform point of view. MSCP is a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
A Study of Breakout Local Search for the Minimum Sum Coloring Problem
Given an undirected graph G = (V,E), the minimum sum coloring problem (MSCP) is to find a legal assignment of colors (represented… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2011
2011
New Algorithm for the Sum Coloring Problem
In this paper we are interested in the elaboration of an approached solution to the sum coloring problem (MSCP), which is an NP… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2005
2005
Development of Terumo implantable left ventricular assist system (T-ILVAS) with a magnetically suspended centrifugal pump
The research group of Terumo, NTN, and the Setsunan University have been developing an implantable left ventricular assist system… (More)
  • figure 3
  • figure 1
  • figure 2
  • table 1
  • figure 4
Is this relevant?
2005
2005
Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
We propose a metaheuristic procedure based on the scatter search approach for solving two location problems with few facilities… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2002
2002
Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups
The braid group with its conjugacy problem is one of the recent hot issues in cryptography. At CT-RSA 2001, Anshel, Anshel… (More)
  • figure 1
Is this relevant?
2002
2002
A Comprehensive Analysis of Indirect Branch Prediction
Indirect branch prediction is a performance limiting factor for current computer systems, preventing superscalar processors from… (More)
Is this relevant?