Sciweavers

8413 search results - page 1518 / 1683
» Ordering Problem Subgoals
Sort
View
152
Voted
IOR
2010
161views more  IOR 2010»
15 years 2 months ago
Mechanism Design for Decentralized Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
145
Voted
JCO
2010
99views more  JCO 2010»
15 years 2 months ago
Online scheduling with a buffer on related machines
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
György Dósa, Leah Epstein
137
Voted
JSAC
2010
142views more  JSAC 2010»
15 years 2 months ago
Extreme value FEC for reliable broadcasting in wireless networks
—The advent of practical rateless codes enables implementation of highly efficient packet-level forward error correction (FEC) strategies for reliable data broadcasting in loss-...
Weiyao Xiao, David Starobinski
123
Voted
JSC
2010
155views more  JSC 2010»
15 years 2 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
116
Voted
PVLDB
2010
110views more  PVLDB 2010»
15 years 2 months ago
Read-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
Prithviraj Sen, Amol Deshpande, Lise Getoor
« Prev « First page 1518 / 1683 Last » Next »