Sciweavers

922 search results - page 2 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
MP
2010
157views more  MP 2010»
13 years 3 months ago
Newton's method for generalized equations: a sequential implicit function theorem
In the extension of Newton’s method to generalized equations, applying to variational inequalities as a special case, convergence analysis relates to a corresponding implicit fun...
Asen L. Dontchev, R. Tyrrell Rockafellar
CADE
2001
Springer
14 years 5 months ago
A New Meta-complexity Theorem for Bottom-Up Logic Programs
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
Harald Ganzinger, David A. McAllester
FOCS
2006
IEEE
13 years 10 months ago
On a Geometric Generalization of the Upper Bound Theorem
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
Uli Wagner
CDC
2008
IEEE
147views Control Systems» more  CDC 2008»
13 years 11 months ago
Applications of the general Lyapunov ISS small-gain theorem for networks
Abstract— In the framework of the ISS Lyapunov formulation a small gain theorem has recently been proved which allows the explicit construction of Lyapunov functions for intercon...
Sergey Dashkovskiy, Björn Rüffer, Fabian...
AUSAI
2010
Springer
13 years 3 months ago
Pushing the Envelope: General Game Players Prove Theorems
A general game player is a system that can play previously unknown games given nothing but their rules. A key to success in this endeavour is the ability to automatically gain know...
Sebastian Haufe, Michael Thielscher