2356 search results - page 151 / 472 » Characterizations of postman sets |
149
click to vote
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
We introduce a model of mutually attracting agents in an arbitrary network, for which the long term behavior results in the emergence of several clusters. The cluster structure is ...
133
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
This paper proposes a disturbance-based control parametrization under the Model Predictive Control framework for constrained linear discrete time systems with bounded additive dis...
139
click to vote
DM
2010
15 years 4 months ago
2010
We characterize all internally 4-connected binary matroids M with the property that the ground set of M can be ordered (e0, . . . , en-1) in such a way that {ei, . . . , ei+t} is 4...
152
click to vote
ENDM
2010
15 years 4 months ago
2010
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
123
click to vote
APAL
2006
15 years 4 months ago
2006
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...