Sciweavers

4131 search results - page 149 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
154
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 26 days ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
LOGCOM
2010
120views more  LOGCOM 2010»
15 years 1 months ago
Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
Franco Montagna, Carles Noguera
137
Voted
AUTOMATICA
1999
119views more  AUTOMATICA 1999»
15 years 3 months ago
Robust L2-gain control for nonlinear systems with projection dynamics and input constraints: an example from traffic control
We formulate the L2-gain control problem for a general nonlinear, state-space system with projection dynamics in the state evolution and hard constraints on the set of admissible ...
Joseph A. Ball, Martin V. Day, Tungsheng Yu, Pushk...
INFORMATICALT
2011
89views more  INFORMATICALT 2011»
14 years 10 months ago
Large-Scale Data Analysis Using Heuristic Methods
Estimation and modelling problems as they arise in many data analysis areas often turn out to be unstable and/or intractable by standard numerical methods. Such problems frequently...
Gintautas Dzemyda, Leonidas Sakalauskas
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...