Sciweavers

2393 search results - page 278 / 479
» Bounds-Consistent Local Search
Sort
View
ESOA
2006
15 years 7 months ago
Dynamic Decentralized Any-Time Hierarchical Clustering
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...
FSE
2006
Springer
111views Cryptology» more  FSE 2006»
15 years 7 months ago
Analysis of Step-Reduced SHA-256
This is the first article analyzing the security of SHA-256 against fast collision search which considers the recent attacks by Wang et al. We show the limits of applying technique...
Florian Mendel, Norbert Pramstaller, Christian Rec...
114
Voted
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 7 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
ECAI
2000
Springer
15 years 7 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
AAAI
2007
15 years 5 months ago
Refutation by Randomised General Resolution
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
Steven David Prestwich, Inês Lynce