Sciweavers

5331 search results - page 283 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
EOR
2000
115views more  EOR 2000»
15 years 7 months ago
An effective implementation of the Lin-Kernighan traveling salesman heuristic
This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric travel...
Keld Helsgaun
SIGIR
2005
ACM
16 years 20 days ago
Optimization strategies for complex queries
Previous research into the efficiency of text retrieval systems has dealt primarily with methods that consider inverted lists in sequence; these methods are known as term-at-a-tim...
Trevor Strohman, Howard R. Turtle, W. Bruce Croft
ICCD
1994
IEEE
69views Hardware» more  ICCD 1994»
15 years 11 months ago
Optimal Design of Self-Damped Lossy Transmission Lines for Multichip Modules
This paper presents a simple and robust method of designing the lossy-transmission-line interconnects in a network for multichip modules. This method uses wire-sizing entirely to ...
Jimmy Shinn-Hwa Wang, Wayne Wei-Ming Dai
SIAMJO
2011
15 years 2 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu
CVPR
2012
IEEE
13 years 9 months ago
Discrete-continuous optimization for multi-target tracking
The problem of multi-target tracking is comprised of two distinct, but tightly coupled challenges: (i) the naturally discrete problem of data association, i.e. assigning image obs...
Anton Andriyenko, Konrad Schindler, Stefan Roth