1696 search results - page 20 / 340 » Permuted function matching |
EVOW
2004
Springer
15 years 3 months ago
2004
Springer
In sequential, deterministic, non-redundant search the algorithm permutes a test function to obtain the search result. The mapping from test functions to search results is a one-to...
111
click to vote
FPGA
1992
ACM
15 years 2 months ago
1992
ACM
The new family of Field Programmable Gate Arrays, CLI6000 from Concurrent Logic Inc realizes the truly Cellular Logic. It has been mainly designed for the realization of data path...
COMBINATORICS
2000
14 years 9 months ago
2000
Let fr n(k) be the number of 132-avoiding permutations on n letters that contain exactly r occurrences of 12 . . . k, and let Fr(x; k) and F (x, y; k) be the generating functions d...
IPL
2000
14 years 9 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
JCT
2010
14 years 8 months ago
2010
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...