Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Ameloot, Tom J."'
Autor:
Ameloot, Tom J., Bussche, Jan Van den
We study a learning principle based on the intuition of forming ramps. The agent tries to follow an increasing sequence of values until the agent meets a peak of reward. The resulting Value-Ramp algorithm is natural, easy to configure, and has a robu
Externí odkaz:
http://arxiv.org/abs/1608.03647
Autor:
Ameloot, Tom J.
We study a framework where agents have to avoid aversive signals. The agents are given only partial information, in the form of features that are projections of task states. Additionally, the agents have to cope with non-determinism, defined as unpre
Externí odkaz:
http://arxiv.org/abs/1605.04691
Autor:
Ameloot, Tom J., Bussche, Jan Van den
We consider a reinforcement learning framework where agents have to navigate from start states to goal states. We prove convergence of a cycle-detection learning algorithm on a class of tasks that we call reducible. Reducible tasks have an acyclic so
Externí odkaz:
http://arxiv.org/abs/1511.08724
Autor:
Ameloot, Tom J., Bussche, Jan Van den, Marczak, William R., Alvaro, Peter, Hellerstein, Joseph M.
Publikováno v:
Theory and Practice of Logic Programming 16 (2016) 378-417
In the Declarative Networking paradigm, Datalog-like languages are used to express distributed computations. Whereas recently formal operational semantics for these languages have been developed, a corresponding declarative semantics has been lacking
Externí odkaz:
http://arxiv.org/abs/1507.05539
Autor:
Ameloot, Tom J., Bussche, Jan Van den
Publikováno v:
Neural Computation, December 2015, Vol. 27, No. 12 , Pages 2623-2660
We study the expressive power of positive neural networks. The model uses positive connection weights and multiple input neurons. Different behaviors can be expressed by varying the connection weights. We show that in discrete time, and in absence of
Externí odkaz:
http://arxiv.org/abs/1502.06094
A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round multiway join algorithms where data is first reshuffled over many servers
Externí odkaz:
http://arxiv.org/abs/1412.4030
Reasoning on Data Partitioning for Single-Round Multi-Join Evaluation in Massively Parallel Systems.
Autor:
Ameloot, Tom J.1,2 (AUTHOR) tom.ameloot@uhasselt.be, Geck, Gaetano3 (AUTHOR) gaetano.geck@udo.edu, Ketsman, Bas2,4 (AUTHOR) bas.ketsman@uhasselt.be, Neven, Frank2 (AUTHOR) frank.neven@uhasselt.be, Schwentick, Thomas3 (AUTHOR) thomas.schwentick@udo.edu
Publikováno v:
Communications of the ACM. Mar2017, Vol. 60 Issue 3, p93-100. 8p. 3 Diagrams.
Autor:
Ameloot, Tom J., Van den Bussche, Jan
Publikováno v:
In Journal of Computer and System Sciences November 2014 80(7):1191-1213
Autor:
AMELOOT, TOM J.1 tom.ameloot@uhasselt.be, NEVEN, FRANK1 frank.neven@uhasselt.be, DEN BUSSCHE, JAN VAN1 jan.vendenbussche@uhasselt.be
Publikováno v:
Journal of the ACM. Apr2013, Vol. 60 Issue 2, p15-15:38. 38p.
Publikováno v:
ACM Transactions on Database Systems. Dec2015, Vol. 40 Issue 4, p21:1-21:45. 45p.