2150 search results - page 247 / 430 » On a restricted cross-intersection problem |
125
click to vote
EOR
2008
15 years 3 months ago
2008
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
177
click to vote
GRID
2008
Springer
15 years 3 months ago
2008
Springer
A myriad of recent activities can be seen towards dynamic workflow composition for processing complex and data intensive problems. Meanwhile, the simultaneous emergence of the gri...
124
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
128
click to vote
ENTCS
2006
15 years 3 months ago
2006
Technologies for overcoming heterogeneities between autonomous data sources are key in the emerging networked world. In this paper we discuss the initial results of a formal inves...
114
click to vote
JCO
2006
15 years 3 months ago
2006
Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned ni numbers with ni lying in a given range. The goal is to maximize a Schur con...