✦ LIBER ✦

An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms

✍ Scribed by Irene Finocchi; Alessandro Panconesi; Riccardo Silvestri

Book ID: 106148555
Publisher: Springer
Year: 2004
Tongue: English
Weight: 462 KB
Volume: 41
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-004-1104-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Experimental Analysis of Parallel Sor

An Experimental Analysis of Parallel Sorting Algorithms

✍ G. E. Blelloch; C. E. Leiserson; B. M. Maggs; C. G. Plaxton; S. J. Smith; M. Zag 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 417 KB

Analysis of a graph coloring based distr

Analysis of a graph coloring based distributed load balancing algorithm

✍ S.H. Hosseini; B. Litow; M. Malkawi; J. McPherson; K. Vairavan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 748 KB

Experimental Analysis of an Online Tradi

Experimental Analysis of an Online Trading Algorithm

✍ Günter Schmidt; Esther Mohr; Mike Kersch 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 208 KB

An experimental analysis of event set al

An experimental analysis of event set algorithms for discrete event simulation

✍ Stavros D. Nikolopoulos; Roderick MacLeod 📂 Article 📅 1993 🏛 Elsevier Science ⚖ 819 KB

Learning Foraging Thresholds for Lizards

Learning Foraging Thresholds for Lizards: an Analysis of a Simple Learning Algorithm

✍ Leslie Ann Goldberg; William E. Hart; David Bruce Wilson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 138 KB

This paper gives proof of convergence for a learning algorithm that describes how anoles (lizards found in the Caribbean) learn foraging threshold distance. An anole will pursue a prey if and only if it is within this threshold of the anole's perch. The learning algorithm was proposed by Roughgarden

Error linearization as an effective tool

Error linearization as an effective tool for experimental analysis of the numerical stability of algorithms

✍ Seppo Linnainmaa 📂 Article 📅 1983 🏛 Springer Netherlands 🌐 English ⚖ 783 KB