356 search results - page 27 / 72 » Approximation schemes for the Min-Max Starting Time Problem |
121
click to vote
ICTCS
2003
Springer
15 years 9 months ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
127
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
169
click to vote
TIP
2002
15 years 3 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
MOC
2000
15 years 3 months ago
2000
Conservative linear equations arise in many areas of application, including continuum mechanics or high-frequency geometrical optics approximations. This kind of equation admits mo...
137
Voted
ALT
2004
Springer
16 years 27 days ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...