14165 search results - page 217 / 2833 » The generalized two-server problem |
121
click to vote
IPCO
2007
15 years 5 months ago
2007
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
131
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
: For an infinite-horizon optimal control problem, the cost does not, in general, converge. The classical work-around to this problem is to introduce a discount or "forgetting...
108
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we present novel algorithmic solutions for several resource processing and data transfer multicriteria optimization problems. The results of most of the presented tec...
140
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
139
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...