Sciweavers

2089 search results - page 89 / 418
» A New Problem in String Searching
Sort
View
KI
2007
Springer
15 years 4 months ago
A Stochastic Local Search Approach to Vertex Cover
We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance ...
Silvia Richter, Malte Helmert, Charles Gretton
SAGA
2001
Springer
15 years 2 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
ICDM
2008
IEEE
129views Data Mining» more  ICDM 2008»
15 years 4 months ago
Sequence Mining Automata: A New Technique for Mining Frequent Sequences under Regular Expressions
In this paper we study the problem of mining frequent sequences satisfying a given regular expression. Previous approaches to solve this problem were focusing on its search space,...
Roberto Trasarti, Francesco Bonchi, Bart Goethals
ISPAN
2002
IEEE
15 years 2 months ago
A New Parallel Genetic Algorithm
One problem of propagating the globally fittest individual via neighbourhood evolving in both island model and cellular model of existing parallel genetic algorithms (PGA) is that...
Ling Tan, David Taniar, Kate A. Smith
WSC
2007
15 years 5 days ago
Stochastic trust region gradient-free method (strong): a new response-surface-based algorithm in simulation optimization
Response Surface Methodology (RSM) is a metamodelbased optimization method. Its strategy is to explore small subregions of the parameter space in succession instead of attempting ...
Kuo-Hao Chang, L. Jeff Hong, Hong Wan