Sciweavers

1074 search results - page 6 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
INFOCOM
2003
IEEE
15 years 2 months ago
MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched data (PSD) in the UMTS Terrestrial Radio Access Net...
Michael Menth, Matthias Schmid, Herbert Heiss, Tho...
CEC
2010
IEEE
14 years 10 months ago
Beyond No Free Lunch: Realistic algorithms for arbitrary problem classes
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
James A. R. Marshall, Thomas G. Hinton
74
Voted
HPDC
1993
IEEE
15 years 1 months ago
A Parallel Object-Oriented Framework for Stencil Algorithms
Wepresent an object-oriented framework for constructing parallel implementations of stencil algorithms. This framework simplifres the development process by encapsulating the comm...
John F. Karpovich, Matthew Judd, W. Timothy Straye...
PDPTA
2008
14 years 11 months ago
A Genetic Algorithm Based Dynamic Load Balancing Scheme for Heterogeneous Distributed Systems
- Load balancing is a crucial issue in parallel and distributed systems to ensure fast processing and optimum utilization of computing resources. Load balancing strategies try to e...
Bibhudatta Sahoo, Sudipta Mohapatra, Sanjay Kumar ...
AE
1997
Springer
15 years 1 months ago
Asymptotical Convergence Rates of Simple Evolutionary Algorithms under Factorizing Mutation Distributions
Abstract. The standard choice for mutating an individual of an evolutionary algorithm with continuous variables is the normal distribution. It is shown that there is a broad class ...
Günter Rudolph