1087 search results - page 106 / 218 » Generation under Space Constraints |
116
click to vote
CONCUR
2007
Springer
15 years 4 months ago
2007
Springer
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
100
click to vote
IANDC
2010
14 years 10 months ago
2010
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
131
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
121
click to vote
SIAMCO
2008
15 years 23 days ago
2008
The aim of this paper is to adapt the Viability Theorem from differential inclusions (governing the evolution of vectors in a finite dimensional space) to so-called morphological i...
112
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Embedded systems are often used in a safety-critical context, e.g. in airborne or vehicle systems. Typically, timing constraints must be satisfied so that real-time embedded syste...