Sciweavers

23589 search results - page 4275 / 4718
» Uncheatable Distributed Computations
Sort
View
JSSPP
2004
Springer
16 years 7 days ago
LOMARC - Lookahead Matchmaking for Multi-resource Coscheduling
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
Angela C. Sodan, Lei Lan
JSSPP
2004
Springer
16 years 7 days ago
Reconfigurable Gang Scheduling Algorithm
 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
Luís Fabrício Wanderley Góes,...
KR
2004
Springer
16 years 7 days ago
Knowledge Discovery by Reversing Inductive Knowledge Representation
In a very basic sense, the aim of knowledge discovery is to reveal structures of knowledge which can be seen as being represented by structural relationships. In this paper, we ma...
Gabriele Kern-Isberner, Jens Fisseler
LATIN
2004
Springer
16 years 7 days ago
On the (Im)possibility of Non-interactive Correlation Distillation
We study the problem of non-interactive correlation distillation (NICD). Suppose Alice and Bob each has a string, denoted by A = a0a1 · · · an−1 and B = b0b1 · · · bn−1,...
Ke Yang
MIDDLEWARE
2004
Springer
16 years 7 days ago
Alternative Edge-Server Architectures for Enterprise JavaBeans Applications
Abstract. Edge-server architectures are widely used to improve webapplication performance for non-transactional data. However, their use with transactional data is complicated by t...
Avraham Leff, James T. Rayfield
« Prev « First page 4275 / 4718 Last » Next »