Sciweavers

535 search results - page 52 / 107
» Insertion and Expansion Operations for
Sort
View
ASPDAC
2008
ACM
150views Hardware» more  ASPDAC 2008»
15 years 1 months ago
Constraint-free analog placement with topological symmetry structure
Abstract-- In analog circuits, blocks need to be placed symmetrically to satisfy the devices matching. Different from the existing constraint-driven approaches, the proposed topolo...
Qing Dong, Shigetoshi Nakatake
CATS
2007
15 years 1 months ago
On the Power of Structural Violations in Priority Queues
We give a priority queue that guarantees the worstcase cost of Θ(1) per minimum finding, insertion, and decrease; and the worst-case cost of Θ(lg n) with at most lg n + O( √ ...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
IJIT
2004
15 years 1 months ago
Restartings: A Technique to Improve Classic Genetic Algorithms' Performance
In this contribution, a way to enhance the performance of the classic Genetic Algorithm is proposed. The idea of restarting a Genetic Algorithm is applied in order to obtain better...
Grigorios N. Beligiannis, Georgios A. Tsirogiannis...
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
15 years 1 months ago
Interpolation search for non-independent data
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
Erik D. Demaine, Thouis R. Jones, Mihai Patrascu
CHES
2010
Springer
172views Cryptology» more  CHES 2010»
15 years 28 days ago
Analysis and Improvement of the Random Delay Countermeasure of CHES 2009
Random delays are often inserted in embedded software to protect against side-channel and fault attacks. At CHES 2009 a new method for generation of random delays was described tha...
Jean-Sébastien Coron, Ilya Kizhvatov