3206 search results - page 272 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
140
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
104
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
This paper attempts to quantify the optimality of FPGA technology mapping algorithms. We develop an algorithm, based on Boolean satisfiability (SAT), that is able to map a small s...
140
click to vote
DAC
2004
ACM
15 years 7 months ago
2004
ACM
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
116
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
119
Voted
ESA
1995
Springer
15 years 7 months ago
1995
Springer
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sor...