16404 search results - page 2685 / 3281 » A set coverage problem |
217
click to vote
ATVA
2006
Springer
15 years 11 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
211
click to vote
ATVA
2006
Springer
15 years 11 months ago
2006
Springer
We address the problem of model checking hybrid systems which exhibit nontrivial discrete behavior and thus cannot be treated by considering the discrete states one by one, as most...
167
click to vote
DATE
2004
IEEE
15 years 11 months ago
2004
IEEE
A challenge facing designers of systems on chip (SoC) containing networks on chip (NoC) is to find NoC instances that balance the cost (e.g. area) and performance (e.g. latency an...
193
click to vote
DSN
2004
IEEE
15 years 11 months ago
2004
IEEE
The main problem we address in this paper is how to map the requirements of a known media service workload into the corresponding system resource requirements and to accurately siz...
176
click to vote
EEE
2004
IEEE
15 years 11 months ago
2004
IEEE
In a catalogue for computer-based models the basic problem is that complex interdependencies between models must be addressed, which are dependent on an application's domain....