Sciweavers

147 search results - page 9 / 30
» Optimal Scheduling of Dynamic Progressive Processing
Sort
View
EGH
2005
Springer
14 years 1 months ago
Optimal automatic multi-pass shader partitioning by dynamic programming
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
Alan Heirich
EAAI
2007
154views more  EAAI 2007»
13 years 8 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
IEEEPACT
2000
IEEE
14 years 24 days ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 8 months ago
Mean field for Markov Decision Processes: from Discrete to Continuous Optimization
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
Nicolas Gast, Bruno Gaujal, Jean-Yves Le Boudec
IPPS
2006
IEEE
14 years 2 months ago
Dynamic resource allocation of computer clusters with probabilistic workloads
Real-time resource scheduling is an important factor for improving the performance of cluster computing. In many distributed and parallel processing systems, particularly real-tim...
Marwan S. Sleiman, Lester Lipsky, Robert Sheahan