1984 search results - page 235 / 397 » Variable mesh optimization for continuous optimization probl... |
158
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
152
click to vote
EOR
2008
15 years 6 months ago
2008
The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...
241
click to vote
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
200
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
263
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...