692 search results - page 7 / 139 » BDD minimization for approximate computing |
97
Voted
RANDOM
2001
Springer
15 years 4 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
78
Voted
RANDOM
2001
Springer
15 years 4 months ago
2001
Springer
We study Euclidean embeddings of Euclidean metrics and present the following four results: (1) an O(log3 n √ log log n) approximation for minimum bandwidth in conjunction with a ...
STOC
1998
ACM
15 years 4 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
COR
2006
15 years 6 days ago
2006
This paper considers the break minimization problem in sports timetabling. The problem is to find, under a given timetable of a round-robin tournament, a home-away assignment that...
125
click to vote
EOR
2011
14 years 7 months ago
2011
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...