Sciweavers

2938 search results - page 420 / 588
» On obfuscating point functions
Sort
View
FC
2007
Springer
141views Cryptology» more  FC 2007»
16 years 19 days ago
The Unbearable Lightness of PIN Cracking
Responding to the PIN cracking attacks from Berkman and Ostrovsky (FC 2007), we outline a simple solution called salted-PIN. A randomly generated salt value of adequate length (e.g...
Omer Berkman, Odelia Moshe Ostrovsky
FSTTCS
2007
Springer
16 years 19 days ago
Solving Parity Games in Big Steps
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
Sven Schewe
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
16 years 19 days ago
Interactive evolutionary multi-objective optimization and decision-making using reference direction method
In this paper, we borrow the concept of reference direction approach from the multi-criterion decision-making literature and combine it with an EMO procedure to develop an algorit...
Kalyanmoy Deb, Abhishek Kumar
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
16 years 19 days ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 19 days ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow