Sciweavers

732 search results - page 24 / 147
» Termination of Integer Linear Programs
Sort
View
IPCO
2010
153views Optimization» more  IPCO 2010»
15 years 1 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
104
Voted
CORR
2010
Springer
85views Education» more  CORR 2010»
15 years 3 months ago
Generic design of Chinese remaindering schemes
We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime inte...
Jean-Guillaume Dumas, Thierry Gautier, Jean-Louis ...
ITCC
2005
IEEE
15 years 9 months ago
Improved Routing-Based Linear Algebra for the Number Field Sieve
Recently, efficient custom-hardware designs were proposed for the linear algebra step of the Number Field Sieve integer factoring algorithm. These designs make use of a heuristic ...
Willi Geiselmann, Hubert Köpfer, Rainer Stein...
SIAMSC
2008
147views more  SIAMSC 2008»
15 years 3 months ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Michael P. Friedlander, Sven Leyffer
141
Voted
CISIS
2008
IEEE
15 years 10 months ago
Hardware Software Partitioning Problem in Embedded System Design Using Particle Swarm Optimization Algorithm
Hardware/software partitioning is a crucial problem in embedded system design. In this paper, we provide an alternative approach to solve this problem using Particle Swarm Optimiz...
Alakananda Bhattacharya, Amit Konar, Swagatam Das,...