Sciweavers

4843 search results - page 440 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
160
Voted
UAI
2000
15 years 6 months ago
Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called probabilistic arc consistency, which is both a generalization of...
Michael C. Horsch, William S. Havens
113
Voted
WSC
2000
15 years 6 months ago
A practical approach to sample-path simulation optimization
We propose solving continuous parametric simulation optimizations using a deterministic nonlinear optimization algorithm and sample-path simulations. The optimization problem is w...
Michael C. Ferris, Todd S. Munson, Krung Sinapirom...
AMC
2010
86views more  AMC 2010»
15 years 5 months ago
BVMs for computing Sturm-Liouville symmetric potentials
The paper deals with the numerical solution of inverse Sturm-Liouville problems with unknown potential symmetric over the interval [0, ]. The proposed method is based on the use o...
Paolo Ghelardoni, Cecilia Magherini
AUTOMATICA
2007
129views more  AUTOMATICA 2007»
15 years 5 months ago
Robust control of polytopic systems by convex optimization
— Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polyto...
Alireza Karimi, Hamid Khatibi, Roland Longchamp
CORR
2010
Springer
113views Education» more  CORR 2010»
15 years 5 months ago
Opaque sets
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
Adrian Dumitrescu, János Pach