Sciweavers

6897 search results - page 621 / 1380
» Parallelization of Modular Algorithms
Sort
View
ICS
1993
Tsinghua U.
15 years 10 months ago
Static and Dynamic Evaluation of Data Dependence Analysis
—Data dependence analysis techniques are the main component of today’s strategies for automatic detection of parallelism. Parallelism detection strategies are being incorporate...
Paul Petersen, David A. Padua
163
Voted
SIGECOM
2004
ACM
135views ECommerce» more  SIGECOM 2004»
16 years 2 days ago
Applying learning algorithms to preference elicitation
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
Sébastien Lahaie, David C. Parkes
203
Voted
ICPP
2002
IEEE
15 years 11 months ago
An Efficient Fault-Tolerant Scheduling Algorithm for Real-Time Tasks with Precedence Constraints in Heterogeneous Systems
In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provi...
Xiao Qin, Hong Jiang, David R. Swanson
JSAC
1998
110views more  JSAC 1998»
15 years 6 months ago
Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm
—In this paper, we will describe the close connection between the now celebrated iterative turbo decoding algorithm of Berrou et al. and an algorithm that has been well known in ...
Robert J. McEliece, David J. C. MacKay, Jung-Fu Ch...
EC
2008
157views ECommerce» more  EC 2008»
15 years 5 months ago
The Crowding Approach to Niching in Genetic Algorithms
A wide range of niching techniques have been investigated in evolutionary and genetic algorithms. In this article, we focus on niching using crowding techniques in the context of ...
Ole J. Mengshoel, David E. Goldberg