2354 search results - page 161 / 471 » Assignment Problems |
142
Voted
RTS
2006
15 years 5 months ago
2006
We consider the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a...
127
Voted
RSA
2000
15 years 4 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...
150
click to vote
MMAS
2010
Springer
14 years 12 months ago
2010
Springer
A unified variational methodology is developed for classification and clustering problems, and tested in the classification of tumors from gene expression data. It is based on flu...
114
click to vote
EUROPLOP
2006
15 years 6 months ago
2006
We present a set of methods to enable a cross-domain reuse of problem solutions via analysis patterns. First, problem-context descriptions and problemcontext models as well as sol...
123
click to vote
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
- This paper presents a solution to the problem of designing interconnects for memory devices. More precisely, it solves the automatic routing problem of memory peripheral circuits...