434 search results - page 52 / 87 » Constraint-Based Combinators for Local Search |
139
click to vote
FSE
2006
Springer
15 years 7 months ago
2006
Springer
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...
128
click to vote
AI
2010
Springer
15 years 3 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
111
Voted
ANOR
2002
15 years 3 months ago
2002
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
109
click to vote
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
117
Voted
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...