2168 search results - page 50 / 434 » Randomized Algorithms and Complexity Theory |
125
Voted
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
102
Voted
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
133
Voted
EUROCRYPT
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
110
Voted
CP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
119
Voted
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...