3250 search results - page 33 / 650 » Parameterized Learning Complexity |
ECML
2007
Springer
13 years 11 months ago
2007
Springer
IWOCA
2010
Springer
13 years 4 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
IWPEC
2004
Springer
14 years 3 months ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
ICPADS
1998
IEEE
14 years 2 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
WSC
2008
14 years 6 days ago
2008
Cluster tools play an important role in modern semiconductor fabs. Due to their complexity in configuration and their varying material flow, the creation of accurate throughput mo...