716 search results - page 59 / 144 » time 1997 |
112
click to vote
DAC
1997
ACM
15 years 5 months ago
1997
ACM
A methodology for architecture exploration of look-up table based decoders is presented. For the degree of parallel processing a trade-off can be made by exploring system level an...
94
Voted
PODS
1997
ACM
15 years 5 months ago
1997
ACM
We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We de ne a framework for measuring the eciency of an ind...
82
Voted
AE
1997
Springer
15 years 5 months ago
1997
Springer
In the running of a genetic algorithm, the population is liable to be con ned in the local optimum, that is the metastable state, making an equilibrium. It is known that, after a l...
102
click to vote
COCOON
1997
Springer
15 years 5 months ago
1997
Springer
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
97
Voted
CP
1997
Springer
15 years 5 months ago
1997
Springer
A number of pitfalls of empirical scheduling research are illustrated using real experimental data. These pitfalls, in general, serve to slow the progress of scheduling research b...