✦ LIBER ✦

A Modified DIviding RECTangles Algorithm for a Problem in Astrophysics

✍ Scribed by D. di Serafino; G. Liuzzi; V. Piccialli; F. Riccio; G. Toraldo

Publisher: Springer
Year: 2011
Tongue: English
Weight: 762 KB
Volume: 151
Category: Article
ISSN: 0022-3239
DOI: 10.1007/s10957-011-9856-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new algorithm for the largest empty re

A new algorithm for the largest empty rectangle problem

✍ M. Orlowski 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 421 KB

Optimal algorithms for rectangle problem

Optimal algorithms for rectangle problems on a mesh-connected computer

✍ Mi Lu; Peter Varman 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 965 KB

Space and time optimal algorithms for a

Space and time optimal algorithms for a class of rectangle intersection problems

✍ V.K. Vaishnavi; H.P. Kriegel; D. Wood 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 581 KB

A modified noising algorithm for the gra

A modified noising algorithm for the graph partitioning problem

✍ V. Sudhakar; C. Siva Ram Murthy 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 804 KB

Many heuristics such as iterative improvement and simulated annealing are available in the literature which try to give a near-optimal solution to the graph partitioning problem. Recently, a new method called the noising method has been proposed for solving combinatorial optimization problems. The n

A data structure and algorithm based on

A data structure and algorithm based on a linear key for a rectangle retrieval problem

✍ D.J. Abel; J.L. Smith 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 567 KB

A modified genetic algorithm for optimal

A modified genetic algorithm for optimal control problems

✍ Zbigniew Michalewicz; Cezary Z. Janikow; Jacek B. Krawczyk 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 698 KB

This paper studies the application of a genetic algorithm to discrete-time optimal control problems. Numerical results obtained here are compared with ones yielded by GAMS, a system for construction and solution of large and complex mathematical programming models. V~l.~e GAMS appears to work well o