Sciweavers

1067 search results - page 162 / 214
» Probabilistic regular graphs
Sort
View
FSTTCS
2008
Springer
15 years 4 months ago
Boolean algebras of unambiguous context-free languages
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
Didier Caucal
CORR
2010
Springer
207views Education» more  CORR 2010»
15 years 3 months ago
A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
This paper presents a simple local medium access control protocol, called Jade, for multi-hop wireless networks with a single channel that is provably robust against adaptive adver...
Andréa W. Richa, Christian Scheideler, Stef...
ENDM
2006
91views more  ENDM 2006»
15 years 3 months ago
There are exactly five biplanes with k=11
A biplane is a 2-(k(k - 1)/2 + 1, k, 2) symmetric design. Only sixteen nontrivial biplanes are known: there are exactly nine biplanes with k < 11, at least five biplanes with k...
Patric R. J. Östergård, Petteri Kaski
IJMC
2006
84views more  IJMC 2006»
15 years 3 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 3 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...