Sciweavers

12015 search results - page 184 / 2403
» Interactive Algorithms 2005
Sort
View
129
Voted
ICDCS
2005
IEEE
15 years 8 months ago
Fine-Grain Adaptive Compression in Dynamically Variable Networks
Despite voluminous previous research on adaptive compression, we found significant challenges when attempting to fully utilize both network bandwidth and CPU. We describe the Fine...
Calton Pu, Lenin Singaravelu
117
Voted
IPPS
2005
IEEE
15 years 8 months ago
MaTCH : Mapping Data-Parallel Tasks on a Heterogeneous Computing Platform Using the Cross-Entropy Heuristic
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
Soumya Sanyal, Sajal K. Das
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
15 years 7 months ago
Symbolic Test Selection Based on Approximate Analysis
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu,...
117
Voted
GECCO
2005
Springer
288views Optimization» more  GECCO 2005»
15 years 8 months ago
A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices
Genetic Algorithms (GAs) are a search and optimization technique based on the mechanism of evolution. Recently, another sort of population-based optimization method called Estimat...
Naoki Mori, Masayuki Takeda, Keinosuke Matsumoto
107
Voted
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
15 years 7 months ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...