A survey of methods for time series change point detection

S Aminikhanghahi, DJ Cook - Knowledge and information systems, 2017 - Springer
Change points are abrupt variations in time series data. Such abrupt changes may represent
transitions that occur between states. Detection of change points is useful in modelling and …

Using anytime algorithms in intelligent systems

S Zilberstein - AI magazine, 1996 - ojs.aaai.org
Anytime algorithms give intelligent systems the capability to trade deliberation time for
quality of results. This capability is essential for successful operation in domains such as …

Policy certificates: Towards accountable reinforcement learning

C Dann, L Li, W Wei, E Brunskill - … Conference on Machine …, 2019 - proceedings.mlr.press
The performance of a reinforcement learning algorithm can vary drastically during learning
because of exploration. Existing algorithms provide little information about the quality of their …

Coalition structure generation with worst case guarantees

T Sandholm, K Larson, M Andersson, O Shehory… - Artificial intelligence, 1999 - Elsevier
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure
that maximizes the sum of the values of the coalitions, but often the number of coalition …

Provably bounded-optimal agents

SJ Russell, D Subramanian - Journal of Artificial Intelligence Research, 1994 - jair.org
Since its inception, artificial intelligence has relied upon a theoretical foundation centered
around perfect rationality as the desired property of intelligent systems. We argue, as others …

Rationality and intelligence

SJ Russell - Artificial intelligence, 1997 - Elsevier
The long-term goal of our field is the creation and understanding of intelligence. Productive
research in AI, both practical and theoretical, benefits from a notion of intelligence that is …

Coalitions among computationally bounded agents

TW Sandhlom, VRT Lesser - Artificial intelligence, 1997 - Elsevier
This paper analyzes coalitions among self-interested agents that need to solve
combinatorial optimization problems to operate efficiently in the world. By colluding …

Metacognition in computation: A selected research review

MT Cox - Artificial intelligence, 2005 - Elsevier
Various disciplines have examined the many phenomena of metacognition and have
produced numerous results, both positive and negative. I discuss some of these aspects of …

Transitions in cognitive evolution

AB Barron, M Halina, C Klein - Proceedings of the …, 2023 - royalsocietypublishing.org
The evolutionary history of animal cognition appears to involve a few major transitions:
major changes that opened up new phylogenetic possibilities for cognition. Here, we review …

Interactive data analysis: The control project

JM Hellerstein, R Avnur, A Chou, C Hidber… - Computer, 1999 - ieeexplore.ieee.org
Data analysis is fundamentally an iterative process in which you issue a query, receive a
response, formulate the next query based on the response, and repeat. You usually don't …