526 search results - page 48 / 106 » On the Number of Minimal Addition Chains |
EURODAC
1995
IEEE
15 years 1 months ago
1995
IEEE
DPLAYOUT is a layout synthesis tool for bit-sliced datapath designs targeting standard-cell libraries. We developed fast and efficient heuristics for placing the cells in a bit-s...
AAAI
2007
15 years 3 days ago
2007
Treebank parsing can be seen as the search for an optimally refined grammar consistent with a coarse training treebank. We describe a method in which a minimal grammar is hierarc...
111
click to vote
NIPS
2007
14 years 11 months ago
2007
Learning the common structure shared by a set of supervised tasks is an important practical and theoretical problem. Knowledge of this structure may lead to better generalization ...
WSC
2004
14 years 11 months ago
2004
An entire emergency department of a general hospital is simulated to examine patient flows. First, times needed for both outpatients and patients arriving via ambulance to be proc...
CPC
2010
14 years 10 months ago
2010
Define the Linus sequence Ln for n 1 as a 0-1 sequence with L1 = 0, and Ln chosen so as to minimize the length of the longest immediately repeated block Ln-2r+1 . . . Ln-r = Ln-r...