Sciweavers

4430 search results - page 74 / 886
» Solving Optimization Problems with DLL
Sort
View
CVPR
2012
IEEE
13 years 5 months ago
Globally optimal line clustering and vanishing point estimation in Manhattan world
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
Jean Charles Bazin, Yongduek Seo, Cédric De...
CSC
2006
15 years 4 months ago
An Algorithm to Solve a Linear Program
: This work is about an algorithm for solving a linear program which is simple to apply. There are three algorithms in this work. The first algorithm solves a two-variable linear p...
Rajan Alex
CP
2007
Springer
15 years 9 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
147
Voted
JCAM
2010
139views more  JCAM 2010»
14 years 9 months ago
A finite difference method for free boundary problems
Fornberg and Meyer-Spasche proposed some time ago a simple strategy to correct finite difference schemes in the presence of a free boundary that cuts across a Cartesian grid. We sh...
Bengt Fornberg
111
Voted
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
15 years 8 months ago
Simultaneity Matrix for Solving Hierarchically Decomposable Functions
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i ...
Chatchawit Aporntewan, Prabhas Chongstitvatana