连锁,连串
发表于 2025-3-28 16:11:20
http://reply.papertrans.cn/88/8779/877814/877814_41.png
confederacy
发表于 2025-3-28 18:59:41
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
发表于 2025-3-29 00:12:56
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
发表于 2025-3-29 04:12:38
978-3-540-20103-8Springer-Verlag Berlin Heidelberg 2003
PAGAN
发表于 2025-3-29 08:23:21
Stochastic Algorithms: Foundations and Applications978-3-540-39816-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
圣歌
发表于 2025-3-29 14:08:10
0302-9743 Overview: Includes supplementary material: 978-3-540-20103-8978-3-540-39816-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
Felicitous
发表于 2025-3-29 18:08:54
http://reply.papertrans.cn/88/8779/877814/877814_47.png
OTHER
发表于 2025-3-29 21:33:36
http://reply.papertrans.cn/88/8779/877814/877814_48.png
Parameter
发表于 2025-3-30 02:22:20
,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 is found to be more reliable than the competing techniques THJ or ECTS .
战胜
发表于 2025-3-30 08:01:50
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.