✦ LIBER ✦

380 A robust and fast algorithm for IMRT optimization with dose-volume contraints

✍ Scribed by S. Breedveld; P. Storchi; B. Heijmen

Book ID: 119517326
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 117 KB
Volume: 76
Category: Article
ISSN: 0167-8140
DOI: 10.1016/s0167-8140(05)81356-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Robust Algorithm for Optimization with

A Robust Algorithm for Optimization with General Equality and Inequality Constraints

✍ Liu, Xin-wei; Yuan, Ya-xiang 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 212 KB

A Fast Robust Optimization Methodology B

A Fast Robust Optimization Methodology Based on Polynomial Chaos and Evolutionary Algorithm for Inverse Problems

✍ Ho, S.L.; Shiyou Yang 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 214 KB

A FAST ALGORITHM FOR OPTIMAL HYDROTHERMA

A FAST ALGORITHM FOR OPTIMAL HYDROTHERMAL SCHEDULING WITH CASCADED AND INDEPENDENT HYDRO PLANTS

✍ MOHAN, M. R.; KUPPUSAMY, K.; KHAN, M. ABDULLAH 📂 Article 📅 1993 🏛 Taylor and Francis Group 🌐 English ⚖ 225 KB

A robust, fast, and accurate deconvoluti

A robust, fast, and accurate deconvolution algorithm for EM-field measurements around GSM and UMTS base stations with a spectrum analyzer

✍ Joseph, W.; Olivier, C.; Martens, L. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 418 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computational Science — ICCS 2001 Volume 2073 || Robust and Fast Algorithm for a Circle Set Voronoi Diagram in a Plane

✍ Alexandrov, Vassil N.; Dongarra, Jack J.; Juliano, Benjoe A.; Renner, René S.; T 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 411 KB

Lncs Volumes 2073 And 2074 Contain The Proceedings Of The International Conference On Computational Science, Iccs 2001, Held In San Francisco, California, May 27-31, 2001. The Two Volumes Consist Of More Than 230 Contributed And Invited Papers That Reflect The Aims Of The Conference To Bring Togethe

Fast On-Line/Off-Line Algorithms for Opt

Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition

✍ Sachin B. Patkar; H. Narayanan 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 143 KB