Sciweavers

693 search results - page 19 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
120
Voted
ICIP
2006
IEEE
16 years 3 months ago
Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
Mala L. Radhakrishnan, Sara L. Su
101
Voted
INFORMATICALT
2007
104views more  INFORMATICALT 2007»
15 years 1 months ago
Key Agreement Protocol (KAP) Using Conjugacy and Discrete Logarithm Problems in Group Representation Level
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
Eligijus Sakalauskas, Povilas Tvarijonas, Andrius ...
98
Voted
ETS
2007
IEEE
94views Hardware» more  ETS 2007»
15 years 8 months ago
An Integrated Built-In Test and Repair Approach for Memories with 2D Redundancy
An efficient on-chip infrastructure for memory test and repair is crucial to enhance yield and availability of SoCs. Therefore embedded memories are commonly equipped with spare r...
Philipp Öhler, Sybille Hellebrand, Hans-Joach...
GECCO
2008
Springer
172views Optimization» more  GECCO 2008»
15 years 2 months ago
Empirical analysis of a genetic algorithm-based stress test technique
Evolutionary testing denotes the use of evolutionary algorithms, e.g., Genetic Algorithms (GAs), to support various test automation tasks. Since evolutionary algorithms are heuris...
Vahid Garousi
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
15 years 8 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett