Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

JC
2002

favoriteEmaildiscussreport

63views more JC 2002»

On the Complexity of Exclusion Algorithms for Optimization

13 years 4 months ago

On the Complexity of Exclusion Algorithms for Optimization

Download www.math.colostate.edu

Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a function over a compact domain. The present paper discusses a new class of tests for such algorithms in the context of global optimization, and presents complexity results concerning the resulting algorithms.

Eugene L. Allgower, Melissa Erdmann, Kurt Georg

Real-time Traffic

Exclusion Algorithms | Interval Analysis | JC 2002 | Well-known Tool |

claim paper

Related Content

» A reliable optimization on distributed mutual exclusion algorithm

» Adaptive mutual exclusion with local spinning

» DeltaSky Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Gener...

» Closing the complexity gap between FCFS mutual exclusion and mutual exclusion

» ExclusiveRegion Based Scheduling Algorithms for UWB WPAN

» Randomized mutual exclusion in Olog N log log N RMRs

» Evolution Strategies with ExclusionBased Selection Operators and a Fourier Series Auxiliar...

» A tight bound on remote reference time complexity of mutual exclusion in the readmodifywri...

» An HVSbased Adaptive Computational Complexity Reduction Scheme for H264AVC video encoder u...

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	JC
Authors	Eugene L. Allgower, Melissa Erdmann, Kurt Georg

Comments (0)