Sciweavers

3250 search results - page 53 / 650
» An Algorithm to Solve a Linear Program
Sort
View
CVPR
2007
IEEE
15 years 11 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
GLVLSI
2006
IEEE
185views VLSI» more  GLVLSI 2006»
15 years 3 months ago
Application of fast SOCP based statistical sizing in the microprocessor design flow
In this paper we have applied statistical sizing in an industrial setting. Efficient implementation of the statistical sizing algorithm is achieved by utilizing a dedicated interi...
Murari Mani, Mahesh Sharma, Michael Orshansky
HAIS
2009
Springer
15 years 2 months ago
Hybrid Evolutionary Algorithm for Solving Global Optimization Problems
Differential Evolution (DE) is a novel evolutionary approach capable of handling non-differentiable, non-linear and multi-modal objective functions. DE has been consistently ranked...
Radha Thangaraj, Millie Pant, Ajith Abraham, Youak...
93
Voted
CSCLP
2007
Springer
15 years 3 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth
WINE
2007
Springer
161views Economy» more  WINE 2007»
15 years 3 months ago
New Algorithms for Approximate Nash Equilibria in Bimatrix Games
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis