1322 search results - page 161 / 265 » Parameterized counting problems |
144
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
99
Voted
COMCOM
2006
15 years 4 months ago
2006
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
110
click to vote
CONSTRAINTS
2007
15 years 4 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
114
Voted
EJC
2007
15 years 3 months ago
2007
We present various techniques to count proportions of permutations with restricted cycle structure in finite permutation groups. For example, we show how a generalized block theo...
137
Voted
MST
2006
15 years 3 months ago
2006
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...