7930 search results - page 1298 / 1586 » Greedy in Approximation Algorithms |
143
click to vote
ENC
2006
IEEE
15 years 8 months ago
2006
IEEE
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...
158
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
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...
124
click to vote
VVS
2000
IEEE
15 years 8 months ago
2000
IEEE
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...
165
click to vote
ICCAD
1995
IEEE
15 years 8 months ago
1995
IEEE
In this paper we investigate activity-driven clock trees to reduce the dynamic power consumption of synchronous digital CMOS circuits. Sections of an activity-driven clock tree ca...
154
Voted
ICPP
1995
IEEE
15 years 8 months ago
1995
IEEE
—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...