2714 search results - page 89 / 543 » Approximation Schemes for Scheduling |
127
Voted
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
114
Voted
WAOA
2004
Springer
15 years 6 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
114
Voted
JMLR
2010
14 years 7 months ago
2010
We consider the problem of correcting the posterior marginal approximations computed by expectation propagation and Laplace approximation in latent Gaussian models and propose cor...
114
click to vote
MOBICOM
2009
ACM
15 years 7 months ago
2009
ACM
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
121
Voted
KDD
2008
ACM
16 years 1 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...