Titlebook: Stochastic Algorithms: Foundations and Applications; Second International Andreas Albrecht,Kathleen Steinhöfel Conference proceedings 2003

连锁,连串

confederacy

Two-Component Traffic Modelled by Cellular Automata: Imposing Passing Restrictions on Slow Vehiclesre determined. We study two main scenarios: two-component traffic without passing restriction (uncontrolled flow) and traffic in which slow vehicles are prohibited to pass (controlled flow). We find that controlling the flow should considerably increase multi-lane highway capacity.

MUTE

Analysis of a Randomized Local Search Algorithm for LDPCC Decoding Problem, approach consists of two approximations. Using a randomized algorithm for LDPCC decoding, we experimentally investigate the reliability of these approximations and show that they could be used as a tool for analyzing the average performance of randomized local search algorithms.

vibrant

978-3-540-20103-8Springer-Verlag Berlin Heidelberg 2003

PAGAN

Stochastic Algorithms: Foundations and Applications978-3-540-39816-5Series ISSN 0302-9743 Series E-ISSN 1611-3349

圣歌

0302-9743 Overview: Includes supplementary material: 978-3-540-20103-8978-3-540-39816-5Series ISSN 0302-9743 Series E-ISSN 1611-3349

Felicitous

OTHER

Parameter

,Global Optimization – Stochastic or Deterministic?,Using an aircraft routing problem as a case-study, this paper reports on some practical experience with stochastic and deterministic methods for global optimization. Results show that the deterministic method DIRECT [12] is found to be more reliable than the competing techniques THJ [1] or ECTS [2].

战胜

Average-Case Complexity of Partial Boolean Functions,The average-case complexity of partial Boolean functions is considered. For almost all functions it is shown that, up to a multiplicative constant, the average-case complexity does not depend on the size of the function’s domain but depends only on the number of tuples on which the function is equal to unity.