3422 search results - page 362 / 685 » Random Subset Optimization |
138
click to vote
IPCO
2010
15 years 5 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
119
click to vote
DAC
2007
ACM
16 years 5 months ago
2007
ACM
In this paper, we propose TROY, the first track router with yield-driven wire planning to optimize yield loss due to random defects. As the probability of failure (POF) computed f...
140
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
140
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
138
click to vote
ACSAC
2009
IEEE
15 years 11 months ago
2009
IEEE
—We take a systematic approach to developing a symmetric cryptography library in Javascript. We study various strategies for optimizing the code for the Javascript interpreter, a...