Sciweavers

7978 search results - page 331 / 1596
» Combining shared-coin algorithms
Sort
View
SAC
2009
ACM
15 years 12 months ago
The sum-of-increments constraint in the consecutive-ones matrix decomposition problem
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
Sebastian Brand
VTS
2006
IEEE
101views Hardware» more  VTS 2006»
15 years 11 months ago
Design Optimization for Robustness to Single Event Upsets
Abstract: An optimization algorithm for the design of combinational circuits that are robust to single-event upsets (SEUs) is described. A simple, highly accurate model for the SEU...
Quming Zhou, Mihir R. Choudhury, Kartik Mohanram
EUROGP
2004
Springer
135views Optimization» more  EUROGP 2004»
15 years 10 months ago
Reusing Code in Genetic Programming
Abstract. In this paper we propose an approach to Genetic Programming based on code reuse and we test it in the design of combinational logic circuits at the gate-level. The circui...
Edgar Galván López, Riccardo Poli, C...
ICDAR
2003
IEEE
15 years 10 months ago
Numeral Recognition by Weighting Local Decisions
This paper presents a new technique to improve the combination of classification decisions obtained from local analysis of patterns. Specifically, a genetic algorithm is used to d...
Giovanni Dimauro, Sebastiano Impedovo, Raffaele Mo...
JAMDS
2002
155views more  JAMDS 2002»
15 years 4 months ago
A new heuristic for the quadratic assignment problem
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
Zvi Drezner