42 search results - page 4 / 9 » Using Lower Bounds During Dynamic BDD Minimization |
117
click to vote
PODS
1995
ACM
15 years 29 days ago
1995
ACM
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
VLSID
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we describe two new algorithms for datapath scheduling which aim at energy reduction while maintaining performance. The proposed algorithms, time constrained and re...
ISQED
2007
IEEE
15 years 3 months ago
2007
IEEE
— In the past, dynamic voltage and frequency scaling (DVFS) has been widely used for power and energy optimization in embedded system design. As thermal issues become increasingl...
140
click to vote
IGIS
1994
15 years 1 months ago
1994
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
PVLDB
2010
14 years 7 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...