Sciweavers

17760 search results - page 249 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
124
Voted
GECCO
2003
Springer
132views Optimization» more  GECCO 2003»
15 years 10 months ago
Circuit Bipartitioning Using Genetic Algorithm
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
Jong-Pil Kim, Byung Ro Moon
PG
2007
IEEE
15 years 11 months ago
A Subdivision Arrangement Algorithm for Semi-Algebraic Curves: An Overview
We overview a new method for computing the arrangement of semi-algebraic curves. A subdivision approach is used to compute the topology of the algebraic objects and to segment the...
Julien Wintz, Bernard Mourrain
PRDC
2006
IEEE
15 years 10 months ago
Fault-Tolerant Rate-Monotonic Scheduling Algorithm in Uniprocessor Embedded Systems
The general approach to fault tolerance in uniprocessor systems is to use time redundancy in the schedule so that any task instance can be re-executed in presence of faults during...
Hakem Beitollahi, Geert Deconinck
CCS
2004
ACM
15 years 10 months ago
Cryptanalysis of a provably secure CRT-RSA algorithm
We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we...
David Wagner
CIE
2010
Springer
15 years 9 months ago
Ergodic-Type Characterizations of Algorithmic Randomness
A useful theorem of Kuˇcera states that given a Martin-L¨of random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A...
Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alex...