2827 search results - page 282 / 566 » Robustness of PSPACE-complete sets |
115
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
129
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...
138
click to vote
P2P
2007
IEEE
15 years 10 months ago
2007
IEEE
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
158
click to vote
ATVA
2007
Springer
15 years 10 months ago
2007
Springer
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
130
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The success of evolutionary algorithms (EAs) depends crucially on finding suitable parameter settings. Doing this by hand is a very time consuming job without the guarantee to ...