Sciweavers

314 search results - page 20 / 63
» Optimizing efficiency of perturbative Monte Carlo method
Sort
View
DAC
2000
ACM
15 years 10 months ago
Practical iterated fill synthesis for CMP uniformity
We propose practical iterated methods for layout density control for CMP uniformity, based on linear programming, Monte-Carlo and greedy algorithms. We experimentally study the tr...
Yu Chen, Andrew B. Kahng, Gabriel Robins, Alexande...
WSC
2008
15 years 23 min ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese
SCFBM
2008
92views more  SCFBM 2008»
14 years 9 months ago
CRANKITE: A fast polypeptide backbone conformation sampler
Background: CRANKITE is a suite of programs for simulating backbone conformations of polypeptides and proteins. The core of the suite is an efficient Metropolis Monte Carlo sample...
Alexei A. Podtelezhnikov, David L. Wild
74
Voted
TWC
2010
14 years 4 months ago
A fixed-lag particle smoother for blind SISO equalization of time-varying channels
We introduce a new sequential importance sampling (SIS) algorithm which propagates in time a Monte Carlo approximation of the posterior fixed-lag smoothing distribution of the symb...
Alberto Gaspar Guimarães, Boujemaa Ait-El-F...
ICRA
2008
IEEE
114views Robotics» more  ICRA 2008»
15 years 4 months ago
Lazy localization using the Frozen-Time Smoother
— We present a new algorithm for solving the global localization problem called Frozen-Time Smoother (FTS). Time is ‘frozen’, in the sense that the belief always refers to th...
Andrea Censi, Gian Diego Tipaldi