Sciweavers

641 search results - page 62 / 129
» On robust online scheduling algorithms
Sort
View
JGTOOLS
2008
137views more  JGTOOLS 2008»
13 years 8 months ago
Robust Soft Shadow Mapping with Backprojection and Depth Peeling
Abstract. Soft shadow mapping is an attractive solution to the problem of realtime soft shadows because it works with any kind of rasterizable geometry (in particular alpha-transpa...
Louis Bavoil, Steven P. Callahan, Cláudio T...
CISS
2007
IEEE
13 years 12 months ago
Channel-Adaptive Optimal OFDMA Scheduling
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
Xin Wang, Georgios B. Giannakis, Yingqun Yu
WAOA
2005
Springer
104views Algorithms» more  WAOA 2005»
14 years 1 months ago
The Online Target Date Assignment Problem
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...
IWNAS
2008
IEEE
14 years 2 months ago
Storage Aware Resource Allocation for Grid Data Streaming Pipelines
Data streaming applications, usually composed with sequential/parallel tasks in a data pipeline form, bring new challenges to task scheduling and resource allocation in grid envir...
Wen Zhang, Junwei Cao, Yisheng Zhong, Lianchen Liu...
WWW
2003
ACM
14 years 8 months ago
Adaptive on-line page importance computation
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
Serge Abiteboul, Mihai Preda, Gregory Cobena