Sciweavers

1095 search results - page 93 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
ICML
2006
IEEE
15 years 10 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
EUROPAR
2007
Springer
15 years 4 months ago
Cooperation in Multi-organization Scheduling
The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We co...
Fanny Pascual, Krzysztof Rzadca, Denis Trystram
JSW
2008
196views more  JSW 2008»
14 years 10 months ago
Providing Data Items with Time Constraints in Multi-Channel Broadcasting Environments
In a mobile computing system, users carrying portable devices can access database services from any location without requiring a fixed position in the networking environment. Some ...
Ding-Jung Chiang, Hwei-Jen Lin, Timothy K. Shih
SCHEDULING
2008
89views more  SCHEDULING 2008»
14 years 9 months ago
Batch scheduling of step deteriorating jobs
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...
M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladi...
EDBT
2006
ACM
103views Database» more  EDBT 2006»
15 years 10 months ago
Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
Foto N. Afrati, Rada Chirkova, Manolis Gergatsouli...