Sciweavers

4117 search results - page 338 / 824
» On the Satisfiability of Complex Constraints
Sort
View
JAR
2000
77views more  JAR 2000»
15 years 6 months ago
Proving Consistency Assertions for Automotive Product Data Management
We present a formal specification and verification approach for industrial product data bases containing Boolean logic formulae to express constraints. Within this framework, globa...
Wolfgang Küchlin, Carsten Sinz
JMIV
2000
143views more  JMIV 2000»
15 years 6 months ago
A Linear Algorithm for Computing the Homography from Conics in Correspondence
Abstract. This paper presents a study, based on conic correspondences, on the relationship between two perspective images acquired by an uncalibrated camera. We show that for a pai...
Akihiro Sugimoto
HEURISTICS
2002
155views more  HEURISTICS 2002»
15 years 6 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
SIAMCO
2002
128views more  SIAMCO 2002»
15 years 6 months ago
Generalized Solutions in Nonlinear Stochastic Control Problems
An optimal stochastic control problem is considered for systems with unbounded controls satisfying an integral constraint. It is shown that there exists an optimal control within t...
F. Dufour, Boris M. Miller
MP
2007
75views more  MP 2007»
15 years 6 months ago
Solving maximum-entropy sampling problems using factored masks
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
Samuel Burer, Jon Lee