203 search results - page 13 / 41 » Improved undecidability results on weighted timed automata |
ALGORITHMICA
2002
13 years 7 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the PRPG before filling the scan chain. In this paper, we present...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
CAV
2010
Springer
13 years 10 months ago
2010
Springer
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
ICPR
2010
IEEE
13 years 11 months ago
2010
IEEE
Obtaining high quality images in MR is desirable not only for accurate visual assessment but also for automatic processing to extract clinically relevant parameters. Filtering-bas...