3142 search results - page 253 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
171
click to vote
CGF
1999
15 years 6 months ago
1999
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly i...
179
click to vote
CPAIOR
2010
Springer
15 years 10 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
223
click to vote
EPIA
1999
Springer
15 years 11 months ago
1999
Springer
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notation...
165
click to vote
MICAI
2007
Springer
16 years 23 days ago
2007
Springer
Previous work on context-specific independence in Bayesian networks is driven by a common goal, namely to represent the conditional probability tables in a most compact way. In th...
238
click to vote
GLOBECOM
2006
IEEE
16 years 21 days ago
2006
IEEE
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...