Sciweavers

PPSN
2010
Springer
13 years 5 months ago
General Lower Bounds for the Running Time of Evolutionary Algorithms
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
Dirk Sudholt
PPSN
2010
Springer
13 years 5 months ago
A Natural Evolution Strategy for Multi-objective Optimization
Abstract. The recently introduced family of natural evolution strategies (NES), a novel stochastic descent method employing the natural gradient, is providing a more principled alt...
Tobias Glasmachers, Tom Schaul, Jürgen Schmid...
PPSN
2010
Springer
13 years 5 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
PPSN
2010
Springer
13 years 5 months ago
Indirect Encoding of Neural Networks for Scalable Go
Abstract. The game of Go has attracted much attention from the artificial intelligence community. A key feature of Go is that humans begin to learn on a small board, and then incr...
Jason Gauci, Kenneth O. Stanley
PPSN
2010
Springer
13 years 5 months ago
Improved Dynamic Lexicographic Ordering for Multi-Objective Optimisation
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. esta...
Juan Pedro Castro Gutiérrez, Dario Landa-Si...
PPOPP
2010
ACM
13 years 5 months ago
Analyzing lock contention in multithreaded applications
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
Nathan R. Tallent, John M. Mellor-Crummey, Allan P...
PODC
2010
ACM
13 years 5 months ago
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowals...
PDP
2010
IEEE
13 years 5 months ago
Investigation of Transient Fault Effects in an Asynchronous NoC Router
— This paper presents Investigation of Transient Fault Effects in an asynchronous NoC router. The experiment is based on simulation-based fault injection method to assess the fau...
Pooria M. Yaghini, Ashkan Eghbal, Hossein Pedram, ...
PDP
2010
IEEE
13 years 5 months ago
FTDS: Adjusting Virtual Computing Resources in Threshing Cases
—In the virtual execution environment, dynamic computing resource adjustment technique, configuring the computing resource of virtual machines automatically according to the actu...
Jian Huang, Hai Jin, Kan Hu, Zhiyuan Shao