674 search results - page 69 / 135 » The computational complexity of the parallel knock-out probl... |
113
click to vote
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
118
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Interactive evolutionary computation (IEC) has proven useful in a variety of applications by combining the subjective evaluation of a user with the massive parallel search power o...
IPPS
2003
IEEE
15 years 6 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...
110
click to vote
IEEEPACT
2000
IEEE
15 years 5 months ago
2000
IEEE
Region-based compilation repartitions a program into more desirable compilation units for optimization and scheduling, particularly beneficial for ILP architectures. With region-...
ICDCS
1999
IEEE
15 years 5 months ago
1999
IEEE
This paper examines the problem of building scalable, fault-tolerant distributed systems from collections of communicating process groups, while maintaining well-defined end-to-en...