14165 search results - page 564 / 2833 » The generalized two-server problem |
296
click to vote
IWPEC
2010
Springer
15 years 5 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
186
Voted
ICCAD
2002
IEEE
16 years 4 months ago
2002
IEEE
This paper presents an approach to the analysis of task sets implemented on multiprocessor systems, when the task execution times are specified as generalized probability distrib...
213
click to vote
TLDI
2009
ACM
16 years 4 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
200
click to vote
HIPC
2005
Springer
16 years 18 days ago
2005
Springer
Abstract In this paper, we consider the problem of scheduling divisible loads onto an heterogeneous star platform, with both heterogeneous computing and communication resources. We...
208
click to vote
GECCO
2003
Springer
16 years 8 days ago
2003
Springer
Abstract. In developing algorithms that dynamically changes the structure and weights of ANN (Artificial Neural Networks), there must be a proper balance between network complexit...