94 search results - page 9 / 19 » On Probabilistic Time versus Alternating Time |
COR
2006
13 years 9 months ago
2006
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
IPPS
2008
IEEE
14 years 3 months ago
2008
IEEE
While desktop grids are attractive platforms for executing parallel applications, their volatile nature has often limited their use to so-called “high-throughput” applications...
MICRO
2006
IEEE
14 years 3 months ago
2006
IEEE
The large working sets of commercial and scientific workloads stress the L2 caches of Chip Multiprocessors (CMPs). Some CMPs use a shared L2 cache to maximize the on-chip cache c...
DEON
2006
Springer
14 years 20 days ago
2006
Springer
In this paper we extend earlier work on deontic deadlines in CTL to the framework of alternating time temporal logic (ATL). The resulting setting enables us to model several concep...
TCS
2008
13 years 9 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...