Sciweavers

452 search results - page 61 / 91
» A mean field approach for optimization in discrete time
Sort
View
ICCAD
1997
IEEE
112views Hardware» more  ICCAD 1997»
15 years 1 months ago
Circuit optimization via adjoint Lagrangians
The circuit tuning problem is best approached by means of gradient-based nonlinear optimization algorithms. For large circuits, gradient computation can be the bottleneck in the o...
Andrew R. Conn, Ruud A. Haring, Chandramouli Viswe...
COCOA
2008
Springer
14 years 11 months ago
Computational Study on Dominating Set Problem of Planar Graphs
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
COMPGEOM
1997
ACM
15 years 1 months ago
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
Giuseppe Liotta, Franco P. Preparata, Roberto Tama...
VLBV
2005
Springer
15 years 3 months ago
Efficient Digital Pre-filtering for Least-Squares Linear Approximation
In this paper we propose a very simple FIR pre-filter based method for near optimal least-squares linear approximation of discrete time signals. A digital pre-processing filter,...
Marco Dalai, Riccardo Leonardi, Pierangelo Miglior...
WSC
2001
14 years 11 months ago
Graphical methods for robust design of a semiconductor burn-in process
Discrete-event simulation is a common tool for the analysis of semiconductor manufacturing systems. With the aid of a simulation model, and in conjunction with sensitivity analysi...
Scott L. Rosen, Chad A. Geist, Daniel A. Finke, Jy...