3422 search results - page 312 / 685 » Random Subset Optimization |
164
click to vote
ISCA
2005
IEEE
15 years 10 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
139
click to vote
APLAS
2000
ACM
15 years 9 months ago
2000
ACM
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...
171
click to vote
DAGSTUHL
2007
15 years 6 months ago
2007
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
195
click to vote
SDM
2004
SIAM
15 years 6 months ago
2004
SIAM
Microarray experiments have been extensively used for simultaneously measuring DNA expression levels of thousands of genes in genome research. A key step in the analysis of gene e...
127
click to vote
SODA
1997
ACM
15 years 6 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...