Sciweavers

3591 search results - page 140 / 719
» Typing linear constraints
Sort
View
AAAI
1996
14 years 11 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker
AUTOMATICA
2008
89views more  AUTOMATICA 2008»
14 years 10 months ago
Controller synthesis with guaranteed closed-loop phase constraints
In this paper, we present an analysis and synthesis framework for guaranteeing that the phase of a single-input, single-output closed-loop transfer function is contained in the int...
Wassim M. Haddad, VijaySekhar Chellaboina, Behnood...
ESOP
2007
Springer
15 years 4 months ago
Interprocedurally Analysing Linear Inequality Relations
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
Helmut Seidl, Andrea Flexeder, Michael Petter
SIBGRAPI
2005
IEEE
15 years 3 months ago
Linear Complexity Stereo Matching Based on Region Indexing
This paper presents a linear complexity method for real-time stereo matching, in which the processing time is only dependent on the image resolution. Regions along each epipolar l...
Marco Antonio Floriano de Oliveira, Raul Sidnei Wa...
MP
2006
88views more  MP 2006»
14 years 10 months ago
Bounds on linear PDEs via semidefinite optimization
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
Dimitris Bertsimas, Constantine Caramanis