2244 search results - page 154 / 449 » A new heuristic approach for non-convex optimization problem... |
232
click to vote
CP
2008
Springer
15 years 9 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 ...
242
click to vote
CP
2003
Springer
16 years 10 days ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
190
click to vote
GECCO
2003
Springer
16 years 9 days ago
2003
Springer
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
225
click to vote
ACML
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
211
Voted
COR
2007
15 years 7 months ago
2007
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Max...