[КНИГА][B] Computer science handbook

AB Tucker - 2004 - taylorfrancis.com
When you think about how far and fast computer science has progressed in recent years, it's
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …

A genetic algorithm that adaptively mutates and never revisits

SY Yuen, CK Chow - IEEE transactions on evolutionary …, 2008 - ieeexplore.ieee.org
A novel genetic algorithm is reported that is non-revisiting: It remembers every position that it
has searched before. An archive is used to store all the solutions that have been explored …

Deep model-based reinforcement learning for high-dimensional problems, a survey

A Plaat, W Kosters, M Preuss - arxiv preprint arxiv:2008.05598, 2020 - arxiv.org
Deep reinforcement learning has shown remarkable success in the past few years. Highly
complex sequential decision making problems have been solved in tasks such as game …

Learning to play chess using temporal differences

J Baxter, A Tridgell, L Weaver - Machine learning, 2000 - Springer
In this paper we present TDLEAF (λ), a variation on the TD (λ) algorithm that enables it to be
used in conjunction with game-tree search. We present some experiments in which our …

Knightcap: a chess program that learns by combining td (lambda) with game-tree search

J Baxter, A Tridgell, L Weaver - arxiv preprint cs/9901002, 1999 - arxiv.org
In this paper we present TDLeaf (lambda), a variation on the TD (lambda) algorithm that
enables it to be used in conjunction with game-tree search. We present some experiments in …

Performance issue monitoring, identification and diagnosis of SaaS software: a survey

R Wang, X Tian, S Ying - Frontiers of Computer Science, 2025 - Springer
Abstract SaaS (Software-as-a-Service) is a service model provided by cloud computing. It
has a high requirement for QoS (Quality of Software) due to its method of providing software …

Learning to Play

A Plaat - Springer International Publishing, Nov, 2020 - Springer
Amazing breakthroughs in reinforcement learning have taken place. Computers teach
themselves to play Chess and Go and beat world champions. There is talk about expanding …

Monte-Carlo tree search by best arm identification

E Kaufmann, WM Koolen - Advances in Neural Information …, 2017 - proceedings.neurips.cc
Recent advances in bandit tools and techniques for sequential learning are steadily
enabling new applications and are promising the resolution of a range of challenging …

[PDF][PDF] Learning depth-first search: A unified approach to heuristic search in deterministic and non-deterministic settings, and its application to MDPs.

B Bonet, H Geffner - ICAPS, 2006 - cdn.aaai.org
Dynamic Programming provides a convenient and unified framework for studying many state
models used in AI but no algorithms for handling large spaces. Heuristic-search methods, on …

Satin: A high-level and efficient grid programming model

RV Van Nieuwpoort, G Wrzesińska… - ACM Transactions on …, 2010 - dl.acm.org
Computational grids have an enormous potential to provide compute power. However, this
power remains largely unexploited today for most applications, except trivially parallel …