Sciweavers

6881 search results - page 182 / 1377
» Motivation
Sort
View
WSC
2008
15 years 8 months ago
An efficient Ranking and Selection procedure for a linear transient mean performance measure
We develop a Ranking and Selection procedure for selecting the best configuration based on a transient mean performance measure. The procedure extends the OCBA approach to systems...
Douglas J. Morrice, Mark W. Brantley, Chun-Hung Ch...
ACMSE
2008
ACM
15 years 8 months ago
A little language for surveys: constructing an internal DSL in Ruby
Using a problem domain motivated by Bentley's"Little Languages" column [1], this paper explores the use of the Ruby programming language's flexible syntax, dyn...
H. Conrad Cunningham
ASPDAC
2008
ACM
116views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Faster projection based methods for circuit level verification
As VLSI fabrication technology progresses to 65nm feature sizes and smaller, transistors no longer operate as ideal switches. This motivates the verification of digital circuits us...
Chao Yan, Mark R. Greenstreet
CCS
2008
ACM
15 years 8 months ago
Private combinatorial group testing
Combinatorial group testing, given a set C of individuals ("customers"), consists of applying group tests on subsets of C for the purpose of identifying which members of...
Mikhail J. Atallah, Keith B. Frikken, Marina Blant...
ASPDAC
2005
ACM
158views Hardware» more  ASPDAC 2005»
15 years 8 months ago
The polygonal contraction heuristic for rectilinear Steiner tree construction
— Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (...
Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xia...