Sciweavers

2182 search results - page 238 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
109
Voted
TCAD
2008
106views more  TCAD 2008»
15 years 2 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
CPAIOR
2008
Springer
15 years 4 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
JVCA
2007
93views more  JVCA 2007»
15 years 2 months ago
Gradient-based shell generation and deformation
Shell becomes popular in a variety of modeling techniques for representing small-scale features and increasing visual complexity. Current shell generation algorithms do not measur...
Jin Huang, Xinguo Liu, Haiyang Jiang, Qing Wang, H...
98
Voted
LFP
1990
73views more  LFP 1990»
15 years 3 months ago
Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs
Many parallel algorithms are naturally expressed at a ne level of granularity, often ner than a MIMD parallel system can exploit eciently. Most builders of parallel systems have...
Eric Mohr, David A. Kranz, Robert H. Halstead Jr.
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 7 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz