Sciweavers

1204 search results - page 53 / 241
» Termination of Polynomial Programs
Sort
View
CORR
2010
Springer
118views Education» more  CORR 2010»
13 years 11 months ago
alphaCertified: certifying solutions to polynomial systems
Smale's -theory uses estimates related to the convergence of Newton's method to give criteria implying that Newton iterations will converge quadratically to solutions to ...
Jonathan D. Hauenstein, Frank Sottile
IWOMP
2009
Springer
14 years 5 months ago
Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
Stephen Olivier, Jan Prins
FMCAD
2004
Springer
14 years 4 months ago
Integrating Reasoning About Ordinal Arithmetic into ACL2
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...
Panagiotis Manolios, Daron Vroon
AUTOMATICA
2010
90views more  AUTOMATICA 2010»
13 years 11 months ago
A line search improvement of efficient MPC
A recent lifting technique led to a computationally efficient Model Predictive Control (MPC) strategy in which the online optimization is performed using a univariate Newton-Raphs...
Basil Kouvaritakis, Shuang Li, Mark Cannon
PODC
2009
ACM
14 years 11 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan