963 search results - page 74 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
106
click to vote
STOC
2003
ACM
16 years 4 days ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
ICPADS
2005
IEEE
15 years 5 months ago
2005
IEEE
As cluster systems become increasingly popular, more and more parallel applications require need not only computing power but also significant I/O performance. However, the I/O s...
IMC
2003
ACM
15 years 5 months ago
2003
ACM
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
103
click to vote
ISPD
2004
ACM
15 years 5 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...