11565 search results - page 194 / 2313 » Computing Minimal Mappings |
129
Voted
FORMATS
2003
Springer
15 years 9 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...
132
click to vote
EVOW
2010
Springer
15 years 9 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...
146
click to vote
ISLPED
1996
ACM
15 years 8 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...
117
Voted
CORR
2010
Springer
15 years 4 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...
113
Voted
AUTOMATICA
2006
15 years 4 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-...