874 search results - page 44 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
AINA
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we study the problem of scheduling messages between two parallel machines connected by a low latency network during a data redistribution. We compare two approaches....
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, we consider the problem of designing scheduling algorithm for input queued switch that is both fair as well as throughput optimal. The significant body of litera...
AAAI
2004
14 years 11 months ago
2004
Performance profile trees have recently been proposed as a theoretical basis for fully normative deliberation control. In this paper we conduct the first experimental study of the...
WSC
2008
15 years 4 days ago
2008
We introduce a new approach, called Relative Start and Idle Time (RSIT), to solve probabilistic scheduling problems of construction repetitive projects. RSIT is a process of deter...