Michael R. Garey and David S. Johnson. Computing and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Researching System Administration - Anderson (Correct)
....consists of a planning phase and an execution phase. The planning phase calculates a plan which tries to minimize the amount of scratch space which is used and minimize the amount of data which needs to be moved. The migration problem is also NP complete, as it is reduceable to subset sum [GJ79] so we use a simple greedy heuristic that will move stores to the final location if possible, and will otherwise choose a candidate store and move all of the stores blocking it into scratch space. This heuristic creates a sequential plan for the migration. If we can move parts of a store at a ....
Michael R. Garey and David S. Johnson. Computing and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
A Hierarchy of Modal Event Calculi: Expressiveness and .. - Cervesato.. (1997) (Correct)
....# in w # until an extension where # holds is found. There are exponentially many such extensions. Since the formula # does not include any modal operator, the test in each extension is polynomial. In order to prove that the considered problem is NP hard, we define a (polynomial) reduction of 3SAT [9] into ICMEC. Let q be a boolean formula in 3CNF, p 1 , p 2 , p n be the propositional variables that occur in q, and q = c 1 c 2 . c m , where c i = l i,1 and for each i, j either l i,j = p k or l i,j = k for some k. Let us define an EC structure E = i ) e(p i ) ....
M.R. Garey and D.S. Johnson. Computing and Intractability: A Guide to the Theory of NP-Completeness, Freeman & Cie, 1979.
Hippodrome: Running Circles Around Storage Administration - Anderson, Hobbs, Keeton.. (2002) (46 citations) (Correct)
....a plan is generated for the migration and then the plan is executed. The planning phase tries to minimize the amount of scratch space used and the amount of data that needs to be moved. The problem of migration planning for variable sized objects is NP complete, as it is reducible to subset sum [17]. We use a simple greedy heuristic that moves stores to their final location. If no store can be moved to its final location in a single step, the heuristic chooses a candidate store (or set of stores, if the underlying device needs to be reconfigured) and moves all of the stores blocking the move ....
M. Garey and D. Johnson. Computing and Intractability: A Guide to the Theory of NP-Completeness.W.H. Freeman and Company, New York, 1979.
A Hierarchy of Modal Event Calculi: Expressiveness and .. - Cervesato.. (1997) (Correct)
....in w 0 until an extension where holds is found. There are exponentially many such extensions. Since the formula does not include any modal operator, the test in each extension is polynomial. In order to prove that the considered problem is NP hard, we define a (polynomial) reduction of 3SAT [9] into ICMEC. Let q be a boolean formula in 3CNF, p 1 ; p 2 ; pn be the propositional variables that occur in q, and q = c 1 c 2 : c m , where c i = l i;1 l i;2 l i;3 and for each i, j either l i;j = p k or l i;j = p k for some k. Let us define an EC structure H = E; P; Deltai; ....
M.R. Garey and D.S. Johnson. Computing and Intractability: A Guide to the Theory of NP-Completeness, Freeman & Cie, 1979.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC