Sciweavers

7796 search results - page 117 / 1560
» On Generalized Schur Numbers
Sort
View
97
Voted
DAM
2010
92views more  DAM 2010»
15 years 26 days ago
Enumeration of matchings in families of self-similar graphs
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
Elmar Teufl, Stephan Wagner
IJCAI
1989
15 years 1 months ago
Acquiring Recursive Concepts with Explanation-Based Learning
Explanation-based generalization algorithms need to generalize the structure of their explanations. This is necessary in order to acquire concepts where a recursive or iterative p...
Jude W. Shavlik
DCC
2011
IEEE
14 years 7 months ago
Primitive polynomials, singer cycles and word-oriented linear feedback shift registers
Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plaus...
Sudhir R. Ghorpade, Sartaj Ul Hasan, Meena Kumari
85
Voted
LATA
2009
Springer
15 years 7 months ago
A Series of Run-Rich Strings
We present a new series of run-rich strings, and give a new lower bound 0.94457567 of the maximum number of runs in a string. We also introduce the general conjecture about a asymp...
Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, A...
93
Voted
DM
2006
104views more  DM 2006»
15 years 24 days ago
Construction of trees and graphs with equal domination parameters
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
Michael Dorfling, Wayne Goddard, Michael A. Hennin...