Sciweavers

498 search results - page 7 / 100
» An algorithm to solve integer linear systems exactly using n...
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li
AAECC
2001
Springer
121views Algorithms» more  AAECC 2001»
14 years 3 hour ago
Algorithms for Large Integer Matrix Problems
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...
Mark Giesbrecht, Michael J. Jacobson Jr., Arne Sto...
CISIS
2008
IEEE
14 years 1 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,...
SIAMJO
2008
114views more  SIAMJO 2008»
13 years 7 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
EPIA
2009
Springer
14 years 2 months ago
Colored Nonograms: An Integer Linear Programming Approach
Abstract. In this paper we study colored nonogram solving using Integer Linear Programming. Our approach generalizes the one used by Robert A. Bosch which was developed for black a...
Luís Mingote, Francisco Azevedo