674 search results - page 89 / 135 » The computational complexity of the parallel knock-out probl... |
148
click to vote
GRID
2008
Springer
15 years 1 months ago
2008
Springer
A myriad of recent activities can be seen towards dynamic workflow composition for processing complex and data intensive problems. Meanwhile, the simultaneous emergence of the gri...
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
102
click to vote
IPPS
2006
IEEE
15 years 7 months ago
2006
IEEE
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of [6, 7], where the same problem was consi...
126
click to vote
PPSN
1992
Springer
15 years 5 months ago
1992
Springer
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
125
click to vote
ICCAD
1996
IEEE
15 years 5 months ago
1996
IEEE
In this paper, we present a new capacitance extraction method named Dimension Reduction Technique (DRT) for 3D VLSI interconnects. The DRT converts a complex 3D problem into a ser...