Sciweavers

3250 search results - page 124 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ICPR
2008
IEEE
16 years 3 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
ORL
2008
115views more  ORL 2008»
15 years 2 months ago
On the convergence of stochastic dual dynamic programming and related methods
We discuss the almost-sure convergence of a broad class of sampling algorithms for multi-stage stochastic linear programs. We provide a convergence proof based on the finiteness o...
Andrew B. Philpott, Z. Guan
147
Voted
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
15 years 6 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
113
Voted
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
15 years 6 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
139
Voted
ICC
2009
IEEE
150views Communications» more  ICC 2009»
15 years 9 months ago
Optimum Internet Gateway Selection in Ad Hoc Networks
—Wireless ad hoc networks are connected to the fixed Internet by means of Internet gateways. Whenever a node within the ad hoc network wishes to communicate with a host in the I...
Felix Hoffmann, Daniel Medina