19866 search results - page 46 / 3974 » Computing all factorizations in *** |
EUROGP
1998
Springer
15 years 4 months ago
1998
Springer
Koza has shown how automatically defined functions (ADFs) can reduce computational effort in the GP paradigm. In Koza's ADF, as well as in standard GP, an improvement in a par...
IPPS
1994
IEEE
15 years 4 months ago
1994
IEEE
This paper describes several algorithms to perform all-to-all communication on a two-dimensional mesh connected computer with wormhole routing. We discuss both direct algorithms, ...
STACS
2009
Springer
15 years 6 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
183
click to vote
Publication
This paper represents the technical core of a pre-competitive consortium formed by AT&T, DEC and MIT to study the technology, architecture and applications of wide-band all-opt...
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...