10182 search results - page 1714 / 2037 » Case Studies |
169
click to vote
DAM
2008
15 years 6 months ago
2008
We present here a systematic study of general boundary value problems on weighted networks that includes the variational formulation of such problems. In particular, we obtain the...
186
click to vote
EOR
2010
15 years 6 months ago
2010
We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI/GI/s + M queue, we focus on developing ...
159
click to vote
DM
2008
15 years 6 months ago
2008
Catalan numbers C(n) = 1 n+1 2n n enumerate binary trees and Dyck paths. The distribution of paths with respect to their number k of factors is given by ballot numbers B(n, k) = n-...
169
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
157
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...