11565 search results - page 194 / 2313 » Computing Minimal Mappings |
163
click to vote
FORMATS
2003
Springer
15 years 11 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
160
click to vote
EVOW
2010
Springer
15 years 11 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
175
click to vote
ISLPED
1996
ACM
15 years 10 months ago
1996
ACM
We present a dynamic programming technique for solving the multiple supply voltage scheduling problem in both nonpipelined and functionally pipelined data-paths. The scheduling pro...
147
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
145
Voted
AUTOMATICA
2006
15 years 6 months ago
2006
This paper is concerned with outer approximations of the minimal disturbance invariant set (MDIS) of a discrete-time linear system with an additive set-bounded disturbance. The k-...