Sciweavers

3791 search results - page 243 / 759
» Packing sets of patterns
Sort
View
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 3 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 3 months ago
A Truthful Mechanism for Offline Ad Slot Scheduling
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constr...
Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, M...
ECCC
2000
140views more  ECCC 2000»
15 years 3 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
ISSRE
2010
IEEE
15 years 2 months ago
Characterizing Failures in Mobile OSes: A Case Study with Android and Symbian
Abstract—As smart phones grow in popularity, manufacturers are in a race to pack an increasingly rich set of features into these tiny devices. This brings additional complexity i...
Amiya Kumar Maji, Kangli Hao, Salmin Sultana, Saur...
JCST
2010
155views more  JCST 2010»
14 years 10 months ago
Efficient Location Updates for Continuous Queries over Moving Objects
Abstract The significant overhead related to frequent location updates from moving objects often results in poor performance. As most of the location updates do not affect the quer...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku