The Experts below are selected from a list of 324 Experts worldwide ranked by ideXlab platform
Tingchi Wang - One of the best experts on this subject based on the ideXlab platform.
-
a fast and Stable Algorithm for obstacle avoiding rectilinear steiner minimal tree construction
Asia and South Pacific Design Automation Conference, 2007Co-Authors: Jhihrong Gao, Tingchi WangAbstract:In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and pre-routed nets. Therefore obstacle-avoiding RSMT (OARSMT) construction becomes a very practical problem. In this paper we present a fast and Stable Algorithm for this problem. We use a partitioning based method and an ant colony optimization based method to construct obstacle-avoiding Steiner minimal tree (OASMT). Besides, two heuristics are proposed to do the rectilinearization and refinement to further improve wirelength. The experimental results show our Algorithm achieves the best wirelength results in most of the test cases and the runtime is very small even for the larger cases each of which has both the number of terminals and the number of obstacles more than 100.
-
ASP-DAC - A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
2007 Asia and South Pacific Design Automation Conference, 2007Co-Authors: Jhihrong Gao, Tingchi WangAbstract:In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and pre-routed nets. Therefore obstacle-avoiding RSMT (OARSMT) construction becomes a very practical problem. In this paper we present a fast and Stable Algorithm for this problem. We use a partitioning based method and an ant colony optimization based method to construct obstacle-avoiding Steiner minimal tree (OASMT). Besides, two heuristics are proposed to do the rectilinearization and refinement to further improve wirelength. The experimental results show our Algorithm achieves the best wirelength results in most of the test cases and the runtime is very small even for the larger cases each of which has both the number of terminals and the number of obstacles more than 100.
Jhihrong Gao - One of the best experts on this subject based on the ideXlab platform.
-
a fast and Stable Algorithm for obstacle avoiding rectilinear steiner minimal tree construction
Asia and South Pacific Design Automation Conference, 2007Co-Authors: Jhihrong Gao, Tingchi WangAbstract:In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and pre-routed nets. Therefore obstacle-avoiding RSMT (OARSMT) construction becomes a very practical problem. In this paper we present a fast and Stable Algorithm for this problem. We use a partitioning based method and an ant colony optimization based method to construct obstacle-avoiding Steiner minimal tree (OASMT). Besides, two heuristics are proposed to do the rectilinearization and refinement to further improve wirelength. The experimental results show our Algorithm achieves the best wirelength results in most of the test cases and the runtime is very small even for the larger cases each of which has both the number of terminals and the number of obstacles more than 100.
-
ASP-DAC - A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
2007 Asia and South Pacific Design Automation Conference, 2007Co-Authors: Jhihrong Gao, Tingchi WangAbstract:In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and pre-routed nets. Therefore obstacle-avoiding RSMT (OARSMT) construction becomes a very practical problem. In this paper we present a fast and Stable Algorithm for this problem. We use a partitioning based method and an ant colony optimization based method to construct obstacle-avoiding Steiner minimal tree (OASMT). Besides, two heuristics are proposed to do the rectilinearization and refinement to further improve wirelength. The experimental results show our Algorithm achieves the best wirelength results in most of the test cases and the runtime is very small even for the larger cases each of which has both the number of terminals and the number of obstacles more than 100.
Duk-in Choi - One of the best experts on this subject based on the ideXlab platform.
-
A new unconditionally Stable Algorithm for steady-state fluid simulation of high density plasma discharge
Journal of Computational Physics, 2001Co-Authors: Hee-hwan Choe, N. S. Yoon, S. S. Kim, Duk-in ChoiAbstract:Abstract A new unconditionally Stable Algorithm for steady-state fluid simulation of high density plasma discharge is suggested. The physical origin of restriction on simulation time step is discussed and a new method to overcome it is explained. To compare the new method with previous other methods, a one-dimensional fluid simulation of inductively coupled plasma discharge is performed.
M. Ketting - One of the best experts on this subject based on the ideXlab platform.
-
Stable Algorithm to simulate dynamic undercarriage loads of tracked vehicles
Archives of Civil and Mechanical Engineering, 2011Co-Authors: J. Hartleb, M. KettingAbstract:Siły działające na podwozie pojazdu gąsienicowego są wynikiem jego złożonych działań. Siły te są spowodowane przez różne zmienne i ich kombinacje. W artykule została opisana metoda symulacji sił działających na podwozie, uwzględniając różne kombinacje krytycznych parametrów. Sprawą nadrzędną było opisanie algorytmu, który pozwala modelować dynamicznie pokonywanie przez koparkę przeszkód biorąc pod uwagę różne parametry takie jak: wysokość przeszkody, prędkość pojazdu, jego deformację. The loads acting on the undercarriage of a tracked vehicle are composed from multiple operation situations which result in dynamic loads. These loads are influenced by different variables and also combinations of these. Within this paper a method is described to simulate the loads acting on the undercarriage taking into consideration the multitude of critical combinations of influencing variables. Priority is given to the description of a calculation Algorithm which allows to dynamically simulate how an excavator runs over an obstacle considering numerous parameters like obstacle height, running speed, track deformation and response behaviour of the overall system.
-
Stable Algorithm to simulate dynamic undercarriage loads of tracked vehicles
Archives of Civil and Mechanical Engineering, 2011Co-Authors: J. Hartleb, M. KettingAbstract:The loads acting on the undercarriage of a tracked vehicle are composed from multiple operation situations which result in dynamic loads. These loads are influenced by different variables and also combinations of these. Within this paper a method is described to simulate the loads acting on the undercarriage taking into consideration the multitude of critical combinations of influencing variables. Priority is given to the description of a calculation Algorithm which allows to dynamically simulate how an excavator runs over an obstacle considering numerous parameters like obstacle height, running speed, track deformation and response behaviour of the overall system.
Hee-hwan Choe - One of the best experts on this subject based on the ideXlab platform.
-
A new unconditionally Stable Algorithm for steady-state fluid simulation of high density plasma discharge
Journal of Computational Physics, 2001Co-Authors: Hee-hwan Choe, N. S. Yoon, S. S. Kim, Duk-in ChoiAbstract:Abstract A new unconditionally Stable Algorithm for steady-state fluid simulation of high density plasma discharge is suggested. The physical origin of restriction on simulation time step is discussed and a new method to overcome it is explained. To compare the new method with previous other methods, a one-dimensional fluid simulation of inductively coupled plasma discharge is performed.
