Sciweavers

693 search results - page 48 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
IDA
2009
Springer
15 years 8 months ago
Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework
Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorit...
Petr Krajca, Vilém Vychodil
GECCO
2005
Springer
152views Optimization» more  GECCO 2005»
15 years 9 months ago
Multi-level genetic algorithm (MLGA) for the construction of clock binary tree
The clock signal and clock skew become more and more important for the circuit performance. Since there are salient shortcomings in the conventional topology construction algorith...
Guofang Nan, Minqiang Li, Jisong Kou
130
Voted
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 4 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
15 years 10 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 11 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin