Sciweavers

414 search results - page 64 / 83
» A parallel extended GCD algorithm
Sort
View
ICDT
2009
ACM
121views Database» more  ICDT 2009»
14 years 8 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz
CEC
2009
IEEE
14 years 2 months ago
Particle Swarm CMA Evolution Strategy for the optimization of multi-funnel landscapes
— We extend the Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) by collaborative concepts from Particle Swarm Optimization (PSO). The proposed Particle Swarm CMA-ES...
Christian L. Müller, Benedikt Baumgartner, Iv...
MFCS
2004
Springer
14 years 1 months ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa
PG
2003
IEEE
14 years 1 months ago
Iso-Splatting: A Point-Based Alternative to Isosurface Visualization
We present a new approach to isosurface visualization that we call “iso-splatting.” We use point primitives for representing and rendering isosurfaces. The method consists of ...
Christopher S. Co, Bernd Hamann, Kenneth I. Joy
BIRTHDAY
2009
Springer
13 years 11 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg