2109 search results - page 178 / 422 » Solving Necklace Constraint Problems |
175
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
In this paper, we consider estimating sparse inverse covariance of a Gaussian graphical model whose conditional independence is assumed to be partially known. Similarly as in [5],...
166
click to vote
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for represen...
148
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
169
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
184
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...