2137 search results - page 383 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
122
click to vote
CONCUR
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
139
click to vote
MICRO
2005
IEEE
15 years 7 months ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
120
click to vote
ACSD
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper proposes a new approach for the hazard checking of timed asynchronous circuits. Previous papers proposed either exact algorithms, which suffer from statespace explosion...
121
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
110
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...