Sciweavers

3128 search results - page 321 / 626
» Finite element method
Sort
View
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
15 years 5 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler
CORR
2010
Springer
129views Education» more  CORR 2010»
15 years 4 months ago
The complexity of positive first-order logic without equality
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
Florent R. Madelaine, Barnaby Martin
CORR
2010
Springer
104views Education» more  CORR 2010»
15 years 4 months ago
A new proof of Nash's Theorem via exchangeable equilibria
We give a novel proof of the existence of Nash equilibria in all finite games without using fixed point theorems or path following arguments. Our approach relies on a new notion i...
Noah D. Stein, Pablo A. Parrilo, Asuman E. Ozdagla...
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 4 months ago
Network-based consensus averaging with general noisy channels
This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updat...
Ram Rajagopal, Martin J. Wainwright
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 4 months ago
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
Gábor Ivanyos, Marek Karpinski, Lajos R&oac...