Abstract
This paper presents an analytical model to estimate the run time for an Q(n∧2) algorithm to identify Pareto points from multi-dimensional data sets, and compares the analytical model with experimental results. This work complements a previous paper by the authors analyzing the run time of a divide & conquer algorithm that operates O(n (log n)∧(d-2)) asymptotic efficiency. Together they form the foundation for ongoing research to develop new, computationally efficient hybrid algorithms to identify Pareto points from preexisting data sets. The work has been done in support of tools to visualize the Pareto Frontier.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 129-144 |
| Number of pages | 16 |
| Journal | Collection of Technical Papers - AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference |
| Volume | 1 |
| State | Published - 2005 |
| Event | 46th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference - Austin, TX, United States Duration: Apr 18 2005 → Apr 21 2005 |
All Science Journal Classification (ASJC) codes
- Architecture
- General Materials Science
- Aerospace Engineering
- Mechanics of Materials
- Mechanical Engineering