1461 search results - page 236 / 293 » Complexity of Graph Covering Problems |
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
EUROMICRO
1996
IEEE
14 years 1 months ago
1996
IEEE
A message passing program composition methodology, called Ensemble, applied for Parix is presented. Ensemble overcomes the implementation problems and complexities in developing a...
FORMATS
2006
Springer
14 years 14 days ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
SCA
2007
13 years 11 months ago
2007
We introduce a framework for advanced behavioral animation in virtual humans, which addresses the challenging open problem of simulating social interactions between pedestrians in...