Sciweavers

929 search results - page 43 / 186
» heuristics 2008
Sort
View
COR
2006
108views more  COR 2006»
13 years 7 months ago
Variable neighborhood search and local branching
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
DISOPT
2006
90views more  DISOPT 2006»
13 years 7 months ago
Tree decompositions of graphs: Saving memory in dynamic programming
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
CSDA
2007
109views more  CSDA 2007»
13 years 7 months ago
Improving the computation of censored quantile regressions
Abstract. Censored quantile regressions (CQR) are a valuable tool in economics and engineering. The computation of estimators is highly complex and the performance of standard meth...
Bernd Fitzenberger, Peter Winker
BIOCOMP
2008
13 years 9 months ago
Bioinformatics Tools: Searching for Markers in DNA/RNA Sequences
Research in bioinformatics and computational biology relies heavily on algorithms that facilitate the understanding of biological processes through the application of statistical ...
Kuha Mahalingam, Omar Bagasra
ACL
2008
13 years 9 months ago
A Discriminative Latent Variable Model for Statistical Machine Translation
Large-scale discriminative machine translation promises to further the state-of-the-art, but has failed to deliver convincing gains over current heuristic frequency count systems....
Phil Blunsom, Trevor Cohn, Miles Osborne