Sciweavers

5 search results - page 1 / 1
» Three-Letter-Pattern-Avoiding Permutations and Functional Eq...
Sort
View
COMBINATORICS
2006
137views more  COMBINATORICS 2006»
13 years 4 months ago
Three-Letter-Pattern-Avoiding Permutations and Functional Equations
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
Ghassan Firro, Toufik Mansour
COMBINATORICS
1998
88views more  COMBINATORICS 1998»
13 years 4 months ago
Multi-statistic enumeration of two-stack sortable permutations
Using Zeilberger’s factorization of two-stack-sortable permutations, we write a functional equation — of a strange sort — that defines their generating function according t...
Mireille Bousquet-Mélou
COMBINATORICS
2007
164views more  COMBINATORICS 2007»
13 years 4 months ago
Longest Alternating Subsequences in Pattern-Restricted Permutations
We determine the limiting distributions of the longest alternating subsequence for pattern-restricted permutations in which the pattern is any one of the six patterns of length th...
Ghassan Firro, Toufik Mansour, Mark C. Wilson
EUSFLAT
2001
108views Fuzzy Logic» more  EUSFLAT 2001»
13 years 6 months ago
Intelligent modelling of the indoor climate in buildings by soft computing
The paper considers the application of soft computing techniques for predictive modelling in the built sector. TakagiSugeno fuzzy models are built by subtractive clustering to pro...
Alexander Gegov
DYNAMO
2000
87views more  DYNAMO 2000»
13 years 5 months ago
Derive: a tool that automatically reverse-engineers instruction encodings
Many binary tools, such as disassemblers, dynamiccode generation systems, and executable code rewriters, need to understand how machine instructions are encoded. Unfortunately, sp...
Dawson R. Engler, Wilson C. Hsieh