Sciweavers

7006 search results - page 1120 / 1402
» Approximation Algorithms
Sort
View
ENC
2006
IEEE
15 years 10 months ago
Adaptive Node Refinement Collocation Method for Partial Differential Equations
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...
José Antonio Muñoz-Gómez, Ped...
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
15 years 10 months ago
Probabilistic modeling for continuous EDA with Boltzmann selection and Kullback-Leibeler divergence
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
Yunpeng Cai, Xiaomin Sun, Peifa Jia
VVS
2000
IEEE
126views Visualization» more  VVS 2000»
15 years 10 months ago
Time critical isosurface refinement and smoothing
Multi-resolution data-structures and algorithms are key in Visualization to achieve real-time interaction with large data-sets. Research has been primarily focused on the off-line...
Valerio Pascucci, Chandrajit L. Bajaj
ICPP
1995
IEEE
15 years 10 months ago
Unicasting in Faulty Hypercubes Using Safety Levels
—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes a...
Jie Wu
ASPDAC
2008
ACM
200views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Non-Gaussian statistical timing analysis using second-order polynomial fitting
In the nanometer manufacturing region, process variation causes significant uncertainty for circuit performance verification. Statistical static timing analysis (SSTA) is thus dev...
Lerong Cheng, Jinjun Xiong, Lei He
« Prev « First page 1120 / 1402 Last » Next »