Sciweavers

5214 search results - page 158 / 1043
» The Online Specialization Problem
Sort
View
COCOON
2005
Springer
15 years 6 months ago
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, C...
WCE
2007
15 years 5 months ago
Solution of Supersonic Internal Flow Problems Using MFDV
— The FDV method was originally developed by T.J. Chung [3]-[6]. The authors developed and presented a modification to this method named MFDV method in [2]. The aim of this modif...
A. A. Megahed, M. W. El-Mallah, B. R. Girgis
EOR
2008
93views more  EOR 2008»
15 years 4 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
144
Voted
JCO
2007
123views more  JCO 2007»
15 years 3 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
ISCA
1993
IEEE
115views Hardware» more  ISCA 1993»
15 years 8 months ago
Parity Logging Overcoming the Small Write Problem in Redundant Disk Arrays
Parity encoded redundant disk arrays provide highly reliable, cost effective secondary storage with high performance for read accesses and large write accesses. Their performance ...
Daniel Stodolsky, Garth A. Gibson, Mark Holland