Sciweavers

620 search results - page 91 / 124
» Towards Optimal Bayesian Algorithmic Mechanism Design
Sort
View
CCR
1998
140views more  CCR 1998»
14 years 9 months ago
Policy tree multicast routing: an extension to sparse mode source tree delivery
Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scal...
Horst Hodel
ROBIO
2006
IEEE
129views Robotics» more  ROBIO 2006»
15 years 4 months ago
Learning Utility Surfaces for Movement Selection
— Humanoid robots are highly redundant systems with respect to the tasks they are asked to perform. This redundancy manifests itself in the number of degrees of freedom of the ro...
Matthew Howard, Michael Gienger, Christian Goerick...
CODES
2007
IEEE
15 years 4 months ago
Reliable multiprocessor system-on-chip synthesis
This article presents a multiprocessor system-on-chip synthesis (MPSoC) algorithm that optimizes system mean time to failure. Given a set of directed acyclic periodic graphs of co...
Changyun Zhu, Zhenyu (Peter) Gu, Robert P. Dick, L...
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
15 years 2 months ago
Mirrored variants of the (1, 2)-CMA-ES compared on the noisy BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ) and (1 + 2) Evolution-Strategies (ESs) with the aim of designing f...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
CEC
2009
IEEE
15 years 4 months ago
Theoretical analysis of rank-based mutation - combining exploration and exploitation
— Parameter setting is an important issue in the design of evolutionary algorithms. Recently, experimental work has pointed out that it is often not useful to work with a fixed ...
Pietro Simone Oliveto, Per Kristian Lehre, Frank N...