| Silicon oxynitride integrated waveguide for on-chip optical interconnects applications | 2 | 0.45 | 2008 |
| Silicon integrated photonics begins to revolutionize | 8 | 2.46 | 2007 |
| Minimizing hydrogen content in silicon oxynitride by thermal oxidation of silicon-rich silicon nitride | 2 | 0.68 | 2006 |
| Approximation of Boolean Functions by Local Search | 0 | 0.34 | 2004 |
| An experimental analysis of local minima to improve neighbourhood search | 6 | 0.60 | 2003 |
| Bounded-depth threshold circuits for computer-assisted CT image classification | 3 | 0.42 | 2002 |
| A Simulated Annealing and Resampling Method for Training Perceptrons to Classify Gene-Expression Data | 0 | 0.34 | 2002 |
| An automata network for performing combinatorial optimization | 1 | 0.35 | 2002 |
| The convergence of stochastic algorithms solving flow shop scheduling | 0 | 0.34 | 2002 |
| An effective quasi-human based heuristic for solving the rectangle packing problem | 52 | 2.41 | 2002 |
| Reduction design for generic universal switch blocks | 10 | 0.69 | 2002 |
| Fast parallel heuristics for the job shop scheduling problem | 9 | 0.89 | 2002 |
| Liver Tissue Classification By Bounded-Depth Threshold Circuits | 0 | 0.34 | 2001 |
| A local search method for pattern classification | 0 | 0.34 | 2001 |
| On the Convergence of Inhomogeneous Markov Chains Approximating Equilibrium Placements of Flexible Objects | 1 | 0.37 | 2001 |
| On Fixed Edges and Edge-Reconstruction of Series-Parallel Networks | 0 | 0.34 | 2001 |
| Logarithmic simulated annealing for X-ray diagnosis | 2 | 0.42 | 2001 |
| Combining the Perceptron Algorithm with Logarithmic Simulated Annealing | 6 | 0.55 | 2001 |
| On the signal bounding problem in timing analysis | 4 | 0.56 | 2001 |
| Distributed Simulated Annealing for Job Shop Scheduling | 1 | 0.37 | 2000 |
| Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems | 4 | 0.45 | 2000 |
| OBDD Minimization Based on Two-Level Representation of Boolean Functions | 0 | 0.34 | 2000 |
| On the bounded domination number of tournaments | 1 | 0.38 | 2000 |
| Inhomogeneous Markov Chains Applied to Pattern Classification | 0 | 0.34 | 2000 |
| Self-Complementary Graphs And Ramsey Numbers Part I: The Decomposition And Construction Of Self-Complementary Graphs | 0 | 0.34 | 2000 |
| Linear time-approximation algorithms for bin packing | 7 | 0.53 | 2000 |
| Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems | 5 | 0.71 | 2000 |
| On Logarithmic Simulated Annealing | 6 | 0.68 | 2000 |
| Rooted Spanning Trees in Tournaments. | 2 | 0.47 | 2000 |
| The Strong Hall Property And Symmetric Chain Orders | 0 | 0.34 | 1999 |
| Two simulated annealing-based heuristics for the job shop scheduling problem | 30 | 2.22 | 1999 |
| On k-ary spanning trees of tournaments | 1 | 0.35 | 1999 |
| Optimal Placements of Flexible Objects: An Adaptive Simulated Annealing Approach | 2 | 0.55 | 1998 |
| Floating Steiner trees | 4 | 0.42 | 1998 |
| Time-varying shortest path problems with constraints | 38 | 2.58 | 1997 |
| The Steiner tree problem in orientation metrics | 10 | 1.08 | 1997 |
| Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case | 2 | 0.53 | 1997 |
| Universal switch modules for FPGA design | 66 | 4.20 | 1996 |
| The Reproducing Placement Problem With Applications | 1 | 0.54 | 1994 |
| Process-variation-tolerant clock skew minimization | 14 | 1.40 | 1994 |
| Single-layer global routing | 15 | 1.46 | 1994 |
| Routing for symmetric FPGAs and FPICs | 18 | 1.78 | 1993 |
| A performance-aimed cell compactor with automatic jogs | 5 | 1.46 | 1992 |
| Incremental time-slot assignment in SS/TDMA satellite systems | 18 | 1.60 | 1991 |
| New algorithms for the rectilinear Steiner tree problem | 30 | 4.77 | 1990 |
| Pad minimization for planar routing of multiple power nets | 3 | 0.53 | 1990 |
| Layer assignment for multichip modules | 27 | 2.75 | 1990 |
| Constructing the optimal rectilinear Steiner tree derivable from a minimum spanning tree | 5 | 1.07 | 1989 |
| A New Approach to the Rectilinear Steiner Tree Problem | 20 | 1.91 | 1989 |
| A powerful global router: based on Steiner min-max trees | 27 | 4.80 | 1989 |
