Sciweavers

1220 search results - page 76 / 244
» Restricting grammatical complexity
Sort
View
ICC
2000
IEEE
105views Communications» more  ICC 2000»
14 years 4 days ago
FDMA Capacity of the Gaussian Multiple Access Channel With ISI
— This paper proposes a numerical method for characterizing the achievable rate region for a Gaussian multiple access channel with ISI under the frequency division multiple acces...
Wei Yu, John M. Cioffi
COCOON
1999
Springer
14 years 13 hour ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
ICCD
1997
IEEE
78views Hardware» more  ICCD 1997»
13 years 12 months ago
Speeding up Variable Reordering of OBDDs
In this paper, we suggest a block-restricted sifting strategy which is based on the restriction of Rudell's sifting to certain blocks of variables. The application of this st...
Christoph Meinel, Anna Slobodová
CSR
2010
Springer
13 years 11 months ago
Zigzags in Turing Machines
We study one-head machines through symbolic and topological dynamics. In particular, a subshift is associated to the subshift, and we are interested in its complexity in terms of r...
Anahí Gajardo, Pierre Guillon
CSCLP
2006
Springer
13 years 11 months ago
A Constraint Model for State Transitions in Disjunctive Resources
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
Roman Barták, Ondrej Cepek