1146 search results - page 147 / 230 » Finite cupping sets |
130
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
110
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In interference alignment, users sharing a wireless channel are each able to achieve data rates of up to half of the non-interfering channel capacity, no matter the number of users...
134
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logi...
121
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
139
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...