14165 search results - page 189 / 2833 » The generalized two-server problem |
126
click to vote
MP
2006
15 years 4 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
111
click to vote
MOC
2002
15 years 3 months ago
2002
The multigrid V -cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction...
114
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
124
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
124
click to vote
CSL
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Church's Problem (1962) asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence X an output...