Sciweavers

12519 search results - page 404 / 2504
» Approximation Problems Categories
Sort
View
ANOR
2007
80views more  ANOR 2007»
15 years 7 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
ESA
2008
Springer
111views Algorithms» more  ESA 2008»
15 years 9 months ago
Parallel Imaging Problem
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
Thành Nguyen, Éva Tardos
NETWORKS
2010
15 years 6 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
ALGORITHMICA
2007
114views more  ALGORITHMICA 2007»
15 years 7 months ago
The Consecutive Ones Submatrix Problem for Sparse Matrices
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (C1S) p...
Jinsong Tan, Louxin Zhang
SIAMJO
2010
137views more  SIAMJO 2010»
15 years 6 months ago
Global Convergence of a New Hybrid Gauss--Newton Structured BFGS Method for Nonlinear Least Squares Problems
In this paper, we propose a hybrid Gauss-Newton structured BFGS method with a new update formula and a new switch criterion for the iterative matrix to solve nonlinear least square...
Weijun Zhou, Xiaojun Chen