268 search results - page 29 / 54 » Cleaning Interval Graphs |
139
click to vote
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
152
click to vote
TSMC
2008
15 years 3 months ago
2008
This paper proposes a type-2 self-organizing neural fuzzy system (T2SONFS) and its hardware implementation. The antecedent parts in each T2SONFS fuzzy rule are interval type-2 fuzz...
105
click to vote
COSIT
2009
Springer
15 years 10 months ago
2009
Springer
Conceptual neighborhood graphs are similarity-based schemata of spatial/temporal relations. This paper proposes a semi-automated method for deriving a conceptual neighborhood graph...
129
click to vote
DM
2006
15 years 3 months ago
2006
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
134
Voted
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...