6365 search results - page 364 / 1273 » Fast Local Computation Algorithms |
176
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
195
click to vote
IJBC
2008
15 years 6 months ago
2008
The localization of critical parameter sets called bifurcations is often a central task of the analysis of a nonlinear dynamical system. Bifurcations of codimension 1 that can be ...
162
click to vote
AISB
1994
Springer
15 years 11 months ago
1994
Springer
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
224
click to vote
TIP
1998
15 years 6 months ago
1998
—We propose novel discrete cosine transform (DCT) pseudophase techniques to estimate shift/delay between two onedimensional (1-D) signals directly from their DCT coefficients by...
166
click to vote
FOCI
2007
IEEE
16 years 1 months ago
2007
IEEE
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...