Sciweavers

1920 search results - page 89 / 384
» The Range Constraint: Algorithms and Implementation
Sort
View
150
Voted
COCOA
2010
Springer
15 years 1 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
135
Voted
CRV
2006
IEEE
223views Robotics» more  CRV 2006»
15 years 9 months ago
Disparity Map Estimation Using A Total Variation Bound
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
Wided Miled, Jean-Christophe Pesquet
169
Voted
RAS
2010
127views more  RAS 2010»
15 years 2 months ago
Maximum-likelihood sample-based maps for mobile robots
— The problem of representing environments of a mobile robot has been studied intensively in the past. The predominant approaches for geometric representations are gridbased or l...
Daniel Meyer-Delius, Wolfram Burgard
141
Voted
RC
2007
148views more  RC 2007»
15 years 3 months ago
Computing Population Variance and Entropy under Interval Uncertainty: Linear-Time Algorithms
In statistical analysis of measurement results, it is often necessary to compute the range [V , V ] of the population variance V = 1 n · n i=1 (xi −E)2 (where E = 1 n · n i=1 ...
Gang Xiang, Martine Ceberio, Vladik Kreinovich
110
Voted
CP
2003
Springer
15 years 9 months ago
Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms
Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm ...
Christophe Lecoutre, Frédéric Bousse...