Sciweavers

8377 search results - page 1539 / 1676
» Scenarios - Introduction
Sort
View
STOC
1999
ACM
106views Algorithms» more  STOC 1999»
15 years 10 months ago
Scheduling in the Dark
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
Jeff Edmonds
AGENTS
1999
Springer
15 years 10 months ago
Team-Partitioned, Opaque-Transition Reinforcement Learning
In this paper, we present a novel multi-agent learning paradigm called team-partitioned, opaque-transition reinforcement learning (TPOT-RL). TPOT-RL introduces the concept of usin...
Peter Stone, Manuela M. Veloso
INFOCOM
1999
IEEE
15 years 10 months ago
Ring versus Tree Embedding for Real-time Group Multicast
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
Mario Baldi, Yoram Ofek
EDCC
1999
Springer
15 years 10 months ago
Dependability Modelling and Sensitivity Analysis of Scheduled Maintenance Systems
Abstract. In this paper we present a new modelling approach for dependability evaluation and sensitivity analysis of Scheduled Maintenance Systems, based on a Deterministic and Sto...
Andrea Bondavalli, Ivan Mura, Kishor S. Trivedi
ICS
1999
Tsinghua U.
15 years 10 months ago
Improving the performance of bristled CC-NUMA systems using virtual channels and adaptivity
Current high-end parallel systems achieve low-latency, highbandwidth network communication through the use of aggressive design techniques and expensive mechanical and electrical ...
José F. Martínez, Josep Torrellas, J...
« Prev « First page 1539 / 1676 Last » Next »