Results 21 to 30 of about 282,088 (296)
Human Control: Definitions and Algorithms
CoRR, 2023 How can humans stay in control of advanced artificial intelligence systems? One proposal is corrigibility, which requires the agent to follow the instructions of a human overseer, without inappropriately influencing them. In this paper, we formally define a variant of corrigibility called shutdown instructability, and show that it implies appropriate ...
Ryan Carey, Tom Everitt
openaire +3 more sources
Thomas decompositions of parametric nonlinear control systems
, 2012 This paper presents an algorithmic method to study structural properties of nonlinear control systems in dependence of parameters. The result consists of a description of parameter configurations which cause different control-theoretic behaviour of the ...
Lange-Hegermann, Markus, Robertz, Daniel
core +1 more source
Proofreading tile sets: Error correction for algorithmic self-assembly [PDF]
, 2004 For robust molecular implementation of tile-based algorithmic self-assembly, methods for reducing errors must be developed. Previous studies suggested that by control of physical conditions, such as temperature and the concentration of tiles, errors ...
Bekbolatov, Renat, Winfree, Erik
core +2 more sources
The FPBA algorithm with controlled capture [PDF]
ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240), 2002 We introduce a new mixed priority scheme that utilizes the logarithmically equi-spaced random transmitter power levels (LESRTPL) model to control the assignment of the transmitter power levels, assigned to each priority class, whose contending over the wireless channel uses the framed pseudo-Bayesian Aloha (FPBA) algorithm to capture the channel.
Mohammed Hadi Habaebi +1 more
openaire +1 more source
Parameter control in evolutionary algorithms [PDF]
IEEE Transactions on Evolutionary Computation, 1999 The issue of controlling values of various parameters of an evolutionary algorithm is one of the most important and promising areas of research in evolutionary computation: it has a potential of adjusting the algorithm to the problem while solving the problem. In the paper we: 1) revise the terminology, which is unclear and confusing, thereby providing
A. E. Eiben +2 more
openaire +1 more source
Quantum Adiabatic Brachistochrone
, 2009 We formulate a time-optimal approach to adiabatic quantum computation (AQC). A corresponding natural Riemannian metric is also derived, through which AQC can be understood as the problem of finding a geodesic on the manifold of control parameters.
A. Hamma +9 more
core +1 more source
RANDOMNESS, UNCERTAINTY, AND COGNITIVE FREEDOM IN THE DATA SOCIETY
Вісник Харківського національного університету імені В.Н. Каразіна. Серия: Теорія культури та філософіі наукиThe modern era of Big Data, in which massive volumes of information and predictive analytics serve as tools for forecasting human behavior, challenges the very notion of free will and personal autonomy.
Kostiantyn Suspitsyn
doaj +1 more source
Algorithmic Trading and Efficiency of the Stock Market in Poland
Finanse i Prawo Finansowe, 2021 The aim of the article is to investigate the impact of algorithmic trading on the returns obtained in the context of market efficiency theory. The research hypothesis is that algorithmic trading can contribute to a better rate of return than when using ...
Rafał Jóźwicki +2 more
doaj +1 more source
When users control the algorithms: Values expressed in practices on the twitter platform [PDF]
, 2019 Recent interest in ethical AI has brought a slew of values, including fairness, into conversations about technology design. Research in the area of algorithmic fairness tends to be rooted in questions of distribution that can be subject to precise ...
Burrell, J +3 more
core
Observations on Factors Affecting Performance of MapReduce based Apriori on Hadoop Cluster
, 2017 Designing fast and scalable algorithm for mining frequent itemsets is always being a most eminent and promising problem of data mining. Apriori is one of the most broadly used and popular algorithm of frequent itemset mining.
Garg, Rakhi +2 more
core +1 more source