12459 search results - page 211 / 2492 » cans 2006 |
106
click to vote
EOR
2006
15 years 4 months ago
2006
We consider the problem of sharing the fixed costs of facilities among a number of users. Although the problem can be formulated and solved as an Integer Programme this provides l...
138
click to vote
ISSE
2006
15 years 4 months ago
2006
Can Design Patterns be turned into reusable components? To help answer this question, we have performed a systematic study of the standard design patterns. One of the most ing is ...
143
click to vote
ITA
2006
15 years 4 months ago
2006
Arithmetical complexity of a sequence is the number of words of length n that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of l...
126
click to vote
DAM
2007
15 years 4 months ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
112
click to vote
MCSS
2006
Springer
15 years 4 months ago
2006
Springer
In this work characterizations of the notion of non-uniform in time robust global asymptotic output stability for hybrid systems with disturbances are given. Based on the provided ...