R.-S. Daruwala, On Computing the Pareto Optimal Solution Set in a Large Scale Dynamic Network, Ph. D. Thesis, New York University, 2002; available at www.cs.nyu.edu/csweb/Research/theses.html. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Maxima-Finding Algorithms for Random Planar Samples - Chen, Hwang, Tsai (2003) (Correct)
....knapsack problems: see [2, 27, 40] 7. longest common subsequence problem: see [3, 38] 8. data mining: see [13, 31] 9. graph drawing: see [7, 41] 10. heuristic search in artificial intelligence: see [1, 22, 50, 58] 11. analysis of linear programming: see [15, 16] 12. transportation: see [18, 20, 21]; 13. gene finding: see [32, 39] 14. statistical decision theory: see [56, 64] 15. ecological process models: see [55, 62] Also many problems in computational geometry involve the maxima finding as a component problem; see [14, 28, 37, 54] For more information and references, see [4, 5, ....
R.-S. Daruwala, On computing the pareto optimal solution set in a large scale dynamic network, Ph. D. Thesis, New York University, 2002; available at www.cs.nyu.edu/csweb/Research/theses.html.
Efficient Maxima-Finding Algorithms for Random Planar Samples - Chen, Hwang, Tsai (2003) (Correct)
....knapsack problems: see [2, 27, 40] 7. longest common subsequence problem: see [3, 38] 8. data mining: see [13, 31] 9. graph drawing: see [7, 41] 10. heuristic search in artificial intelligence: see [1, 22, 50, 58] 11. analysis of linear programming: see [15, 16] 12. transportation: see [18, 20, 21]; 13. gene finding: see [32, 39] 14. statistical decision theory: see [56, 64] 15. ecological process models: see [55, 62] Also many problems in computational geometry involve the maxima finding as a component problem; see [14, 28, 37, 54] For more information and references, see [4, 5, ....
R.-S. Daruwala, On computing the pareto optimal solution set in a large scale dynamic network, Ph. D. Thesis, New York University, 2002; available at www.cs.nyu.edu/csweb/Research/theses.html.
Efficient Maxima-Finding Algorithms for Random Planar Samples - Chen, Hwang, Tsai (2003) (Correct)
No context found.
R.-S. Daruwala, On Computing the Pareto Optimal Solution Set in a Large Scale Dynamic Network, Ph. D. Thesis, New York University, 2002; available at www.cs.nyu.edu/csweb/Research/theses.html.
Efficient Maxima-Finding Algorithms for Random Planar Samples - Wei-Mei Chen Department (2003) (Correct)
No context found.
R.-S. Daruwala, On Computing the Pareto Optimal Solution Set in a Large Scale Dynamic Network, Ph. D. Thesis, New York University, 2002; available at www.cs.nyu.edu/csweb/Research/theses.html.
Efficient Maxima-Finding Algorithms for Random Planar Samples - Chen, Hwang, Tsai (2003) (Correct)
No context found.
R.-S. Daruwala, On Computing the Pareto Optimal Solution Set in a Large Scale Dynamic Network, Ph. D. Thesis, New York University, 2002; available at www.cs.nyu.edu/csweb/Research/theses.html.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC