Sciweavers

1220 search results - page 23 / 244
» Minimal Interval Completions
Sort
View
EOR
2006
130views more  EOR 2006»
13 years 7 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 7 months ago
Verified Real Number Calculations: A Library for Interval Arithmetic
—Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a...
Marc Daumas, David Lester, César Muñ...
AUTOMATICA
2005
152views more  AUTOMATICA 2005»
13 years 7 months ago
Identification of dynamical systems with a robust interval fuzzy model
In this paper we present a new method of interval fuzzy model identification. The method combines a fuzzy identification methodology with some ideas from linear programming theory...
Igor Skrjanc, Saso Blazic, Osvaldo E. Agamennoni
JAIR
2000
105views more  JAIR 2000»
13 years 7 months ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber
EMMCVPR
2001
Springer
14 years 3 days ago
Multiple Contour Finding and Perceptual Grouping as a Set of Energy Minimizing Paths
We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in ...
Laurent D. Cohen, Thomas Deschamps