3433 search results - page 342 / 687 » Heuristics for a bidding problem |
177
click to vote
IPPS
1996
IEEE
15 years 11 months ago
1996
IEEE
In a shared-memory multiprocessor system, it is possible that certain synchronization operations are redundant -that is, their corresponding sequencing requirements are enforced c...
189
click to vote
VLDB
1997
ACM
15 years 11 months ago
1997
ACM
Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a framework for analyzing the issues in selecting vi...
173
click to vote
DAC
1989
ACM
15 years 11 months ago
1989
ACM
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...
176
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Network topology design problems find application in several real life scenarios. However, most designs in the past either optimize for a single criterion like delay or assume sim...
158
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...