Sciweavers

15485 search results - page 328 / 3097
» Computing Optimal Subsets
Sort
View
USENIX
2000
15 years 8 months ago
Dynamic Function Placement for Data-Intensive Cluster Computing
Optimally partitioning application and filesystem functionality within a cluster of clients and servers is a difficult problem due to dynamic variations in application behavior, r...
Khalil Amiri, David Petrou, Gregory R. Ganger, Gar...
AIR
2005
130views more  AIR 2005»
15 years 6 months ago
Framework for Task Scheduling in Heterogeneous Distributed Computing Using Genetic Algorithms
An algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environment with dynam...
Andrew J. Page, Thomas J. Naughton
TRANSCI
2008
80views more  TRANSCI 2008»
15 years 6 months ago
An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is sum of a congestion function and a disutility function. We pro...
Frédéric Babonneau, Jean-Philippe Vi...
ICASSP
2011
IEEE
14 years 10 months ago
On spatio-temporal Tomlinson Harashima Precoding in IIR channels: MMSE solution, properties, and fast computation
We consider spatio-temporal Tomlinson Harashima Precoding where the feedforward filter is located at the transmitter and an additional scalar gain is employed as receive filter....
Sander Wahls, Holger Boche
ICCS
2005
Springer
16 years 6 days ago
The Dynamics of Computing Agent Systems
The paper presents the Multi Agent System (MAS) designed for the large scale parallel computations. The special kind of diffusionbased scheduling enables to decompose and allocate...
Maciej Smolka, Piotr Uhruski, Robert Schaefer, Mar...