Sciweavers

3049 search results - page 154 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICDE
2006
IEEE
190views Database» more  ICDE 2006»
16 years 13 days ago
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
Elke Michlmayr
SIAMJO
2008
112views more  SIAMJO 2008»
15 years 6 months ago
Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained n...
Charles Audet, J. E. Dennis, Sébastien Le D...
ICML
1998
IEEE
16 years 7 months ago
Multiagent Reinforcement Learning: Theoretical Framework and an Algorithm
In this paper, we adopt general-sum stochastic games as a framework for multiagent reinforcement learning. Our work extends previous work by Littman on zero-sum stochastic games t...
Junling Hu, Michael P. Wellman
TEC
2008
97views more  TEC 2008»
15 years 6 months ago
Ergonomic Chair Design by Fusing Qualitative and Quantitative Criteria Using Interactive Genetic Algorithms
This paper emphasizes the necessity of formally bringing qualitative and quantitative criteria of ergonomic design together, and provides a novel complementary design framework wit...
Alexandra Melike Brintrup, Jeremy Ramsden, Hideyuk...
ICALP
2003
Springer
15 years 11 months ago
Quantum Search on Bounded-Error Inputs
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
Peter Høyer, Michele Mosca, Ronald de Wolf