Sciweavers

5331 search results - page 162 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
14 years 11 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
NCA
2008
IEEE
14 years 10 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
14 years 5 months ago
Dynamic power allocation in server farms: A Real Time Optimization approach
Abstract-- This paper concerns the power minimization problem in server farms. The power minimization problem over dynamic power allocation schemes is formally defined and formulat...
Mohammadreza Aghajani, Luca Parolini, Bruno Sinopo...
ISSAC
1995
Springer
108views Mathematics» more  ISSAC 1995»
15 years 1 months ago
A Solution to the Extended GCD Problem
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
Bohdan S. Majewski, George Havas
ICML
2010
IEEE
14 years 11 months ago
A Simple Algorithm for Nuclear Norm Regularized Problems
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
Martin Jaggi, Marek Sulovský