Sciweavers

1795 search results - page 136 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
DAC
1989
ACM
14 years 13 days ago
An Efficient Finite Element Method for Submicron IC Capacitance Extraction
We present an accurate and efficient method for extraction of parasitic capacitances in submicron integrated circuits. The method uses a 3-D finite element model in which the cond...
N. P. van der Meijs, Arjan J. van Genderen
GLVLSI
2007
IEEE
173views VLSI» more  GLVLSI 2007»
13 years 9 months ago
Modeling and estimating leakage current in series-parallel CMOS networks
This paper reviews the modeling of subthreshold leakage current and proposes an improved model for general series-parallel CMOS networks. The presence of on-switches in off-networ...
Paulo F. Butzen, André Inácio Reis, ...
CORR
2007
Springer
74views Education» more  CORR 2007»
13 years 9 months ago
Secure Two-party Protocols for Point Inclusion Problem
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
Tony Thomas
ICRA
2007
IEEE
132views Robotics» more  ICRA 2007»
14 years 3 months ago
Smooth Feedback for Car-Like Vehicles in Polygonal Environments
— We introduce a method for constructing provably safe smooth feedback laws for car-like robots in obstaclecluttered polygonal environments. The robot is taken to be a point with...
Stephen R. Lindemann, Steven M. LaValle
DAWAK
2008
Springer
13 years 10 months ago
UML-Based Modeling for What-If Analysis
In order to be able to evaluate beforehand the impact of a strategical or tactical move, decision makers need reliable previsional systems. What-if analysis satisfies this need by ...
Matteo Golfarelli, Stefano Rizzi