Sciweavers

41 search results - page 7 / 9
» Quality of positive root bounds
Sort
View
ISSAC
2007
Springer
105views Mathematics» more  ISSAC 2007»
14 years 3 months ago
Certification of the QR factor R and of lattice basis reducedness
Given a lattice basis of n vectors in Zn, we propose an algorithm using 12n3 + O(n2) floating point operations for checking whether the basis is LLL-reduced. If the basis is redu...
Gilles Villard
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
14 years 2 months ago
Reinforcement learning for games: failures and successes
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...
Wolfgang Konen, Thomas Bartz-Beielstein
EUROPAR
2000
Springer
14 years 1 months ago
On the Performance of Fetch Engines Running DSS Workloads
Abstract This paper examines the behavior of current and next generation microprocessors' fetch engines while running Decision Support Systems (DSS) workloads. We analyze the ...
Carlos Navarro, Alex Ramírez, Josep-Lluis L...
CN
2006
82views more  CN 2006»
13 years 9 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue
TSP
2010
13 years 4 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji