1146 search results - page 113 / 230 » Finite cupping sets |
136
click to vote
DM
2008
15 years 4 months ago
2008
In this paper we are concerned with the following question: for a semigroup S, what is the largest size of a subsemigroup T S where T has a given property? The semigroups S that w...
117
click to vote
ENTCS
2008
15 years 4 months ago
2008
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
119
click to vote
AUTOMATICA
2006
15 years 4 months ago
2006
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
115
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
142
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system ...