Sciweavers

24 search results - page 4 / 5
» Polynomial Preconditioning for Specially Structured Linear S...
Sort
View
ICALP
2011
Springer
12 years 9 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
DM
2006
128views more  DM 2006»
13 years 5 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
CDC
2009
IEEE
184views Control Systems» more  CDC 2009»
13 years 10 months ago
Controllability and observability of uncertain systems: A robust measure
— This paper deals with the class of polynomially uncertain continuous-time linear time-invariant (LTI) systems whose uncertainties belong to a semi-algebraic set. The objective ...
Somayeh Sojoudi, Javad Lavaei, Amir G. Aghdam
CSCLP
2004
Springer
13 years 11 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
13 years 24 days ago
Q-learning and enhanced policy iteration in discounted dynamic programming
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
Dimitri P. Bertsekas, Huizhen Yu