1578 search results - page 132 / 316 » Algorithmic randomness of continuous functions |
ICCAD
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
109
Voted
CEC
2009
IEEE
15 years 9 months ago
2009
IEEE
— In this paper, we propose a new algorithm, named JACC-G, for large scale optimization problems. The motivation is to improve our previous work on grouping and adaptive weightin...
129
click to vote
SOCO
2010
Springer
2010
Springer
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
15 years 21 days ago
Local genetic algorithms have been designed with the aim of providing effective intensification. One of their most outstanding features is that they may help classical local searc...
ASIACRYPT
2009
Springer
15 years 9 months ago
2009
Springer
An r-collision for a function is a set of r distinct inputs with identical outputs. Actually finding r-collisions for a random map over a finite set of cardinality N requires at ...
112
click to vote
PC
2007
15 years 1 months ago
2007
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...