13376 search results - page 401 / 2676 » Problem Solving with |
155
click to vote
SIAMDM
2010
14 years 11 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
139
click to vote
COCO
2000
Springer
15 years 8 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
186
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
132
click to vote
KRDB
1994
15 years 6 months ago
1994
This paper presents, fromthe author's perspective, the problems that occur in practice during data modelling. The author's experiences are a result of a considerable num...
177
click to vote
SIAMSC
2008
15 years 4 months ago
2008
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...