2446 search results - page 52 / 490 » Where am I |
SIAMDM
2008
13 years 9 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
SIAMSC
2008
13 years 9 months ago
2008
In this note we consider the numerical solution of selfadjoint deblurring problems on bounded intervals. For these problems it has recently been shown that appropriate modelling of...
MOR
2007
13 years 9 months ago
2007
A deterministic server is shared by users with identical linear waiting costs, requesting jobs of arbitrary lengths. Shortest jobs are served first for efficiency. The server can...
SIAMCOMP
2010
13 years 8 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
SIAMJO
2010
13 years 8 months ago
2010
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...