770 search results - page 142 / 154 » Latent Class Models for Algorithm Portfolio Methods |
131
Voted
JMLR
2006
15 years 1 months ago
2006
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
134
click to vote
PE
2010
Springer
15 years 8 days ago
2010
Springer
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
107
click to vote
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
121
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
128
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...