Sciweavers

4315 search results - page 233 / 863
» Sorting in linear time
Sort
View
106
Voted
ANOR
2002
89views more  ANOR 2002»
15 years 2 months ago
Imperfect Inspection Games Over Time
We consider an inspection game played on a continuous finite time interval. The inspector wishes to detect a violation as soon as possible after it has been made by the operator. T...
Daniel Rothenstein, Shmuel Zamir
101
Voted
HEURISTICS
2002
65views more  HEURISTICS 2002»
15 years 2 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...
216
Voted
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 2 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
99
Voted
ICCD
2008
IEEE
150views Hardware» more  ICCD 2008»
15 years 11 months ago
Timing analysis considering IR drop waveforms in power gating designs
—IR drop noise has become a critical issue in advanced process technologies. Traditionally, timing analysis in which the IR drop noise is considered assumes a worst-case IR drop ...
Shih-Hung Weng, Yu-Min Kuo, Shih-Chieh Chang, Malg...
109
Voted
ICCAD
2005
IEEE
133views Hardware» more  ICCAD 2005»
15 years 11 months ago
Gate sizing using incremental parameterized statistical timing analysis
— As technology scales into the sub-90nm domain, manufacturing variations become an increasingly significant portion of circuit delay. As a result, delays must be modeled as sta...
Matthew R. Guthaus, Natesan Venkateswaran, Chandu ...