1550 search results - page 19 / 310 » Optimizing search by showing results in context |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Fault-based testing is often advocated to overcome limitations of other testing approaches; however it is also recognized as being expensive. On the other hand, evolutionary algor...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
NIPS
1993
13 years 9 months ago
1993
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...
ECMDAFA
2010
Springer
13 years 11 months ago
2010
Springer
Dynamic UML models like sequence diagrams (SD) lack sufficient formal semantics, making it difficult to build automated tools for their analysis, simulation and validation. A commo...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...