5595 search results - page 258 / 1119 » Comparing Subsumption Optimizations |
141
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
Technology-independenttimingoptimizationis animportantproblem in logic synthesis. Although many promising techniques have been proposed in the past, unfortunately they are quite s...
165
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
208
click to vote
PODS
1995
ACM
15 years 10 months 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,...
178
click to vote
MASCOTS
2003
15 years 8 months ago
2003
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
186
click to vote
SIGIR
2010
ACM
15 years 6 months ago
2010
ACM
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...