18306 search results - page 289 / 3662 » Algorithmics in Exponential Time |
163
click to vote
ICPP
2007
IEEE
16 years 1 months ago
2007
IEEE
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is b...
168
click to vote
FMSD
2006
15 years 6 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
172
click to vote
CAV
1994
Springer
15 years 10 months ago
1994
Springer
This paper presents a new formalism and a new algorithm for verifying timed circuits. The formalism, called orbital nets, allows hierarchical verification based on abehavioralseman...
174
click to vote
CAV
2010
Springer
15 years 10 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
181
click to vote
ORL
2002
15 years 6 months ago
2002
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...