Reasons-sensitivity and degrees of free will by Kaiserman, A

“…This paper offers a novel account of degrees of free will, taking as its starting point the idea that an action is free to the extent to which the agent was sensitive, in acting, to reasons for or against performing that action. …”

Multi-agent path finding (part B) by Cao, Lifeng

“…Multi-Agent Pathfinding (MAPF) is the problem of finding paths efficient collision-free paths for sets of agents with a designated start and end goal. …”
Get full text

Analysis of a complex network of financial agents. by Chen, Jonathan Guan Wei.

Get full text

Reinforcement learning in online principal­-agent problems by Yue, Ming Long

“…In this paper, we focus on online principal-agent problems. We propose the utilisation of reinforcement learning methods to allow the principal to learn to generate optimal contracts in an end-to-end fashion, solving the principal-agent problem in a model-free manner without the need for prior knowledge of the environment or explicit modelling of the problem.…”
Get full text

Ultrasound contrast agent modeling: A review by Versluis, M, Stride, E, Lajoinie, G, Dollet, B, Segers, T

“…We then present the basics of free-gas-bubble dynamics upon which UCA modeling is based. …”

Multi-Agent Reinforcement Learning for Autonomous Robotics by Vincent, Caroline R.

“…The impact of integrating robotic agents into real-world applications may be significantly enhanced by leveraging advancements in multi-agent autonomous systems. …”
Get full text
Get full text

Multi-agent path finding (part C) by Chua, Wen Kai

“…Multi-agent path-finding is about the development and evaluation of algorithms and techniques to find high-quality collision-free paths for teams of agents to reach their target locations in real-time with consideration of various types of constraints. …”
Get full text

Distributed multi-agent consensus under constraints by Qiu, Zhirong

“…The first part of the thesis considers the quantized consensus problem under data rate constraint. In a multi-agent network, any communication channel has limited capacity and only finite bits of error-free information can be transmitted per unit time. …”
Get full text

Electrodeposition of lead‐free solder alloys by Goh, Y., Haseeb, A.S. Md. Abdul, Sabri, M.F.M.

“…Purpose – The purpose of this paper is to enhance the understanding on the electrodeposition of various lead (Pb)‐free solder alloys, so that new studies can be carried out to solve processing issues. …”

A) Nitrogen-directed homoallylic free-radical rearrangements for the construction of bridged azacycles B) Studies on a total synthesis of the microbial immunosuppressive agent FR901483 C) Phosphinoboranes as bifunctional organocatalysts and ambiphilic ligands by Bebbington, M, Bourissou, D, Bouhadir, G, Bontemps, S, Weinreb, S, Kropf, J, Meigh, I, Hodgson, D, Willis, P

Development of alpha mangostin-PLGA nanoparticles as an anticancer agent by Aimen, Abdo, Mohamed, Farahidah, Bakhtiar, M. Taher

Get full text
Get full text

Competing transmission of multiple infectious agents in multiplex networks by Yu, Jie

“…The main purpose of this project is study the transmission of infectious agents in complex networks, in order to find out and discuss the model that the infectious agent transmitted. …”
Get full text

Cloud driven implementation for multi-agent path finding by Datta, Anusha

“…Multi-Agent Path Finding (MAPF) is the computational problem of constructing collision-free paths for a set of agents from their respective start to goal positions within a given maze. …”
Get full text

Black-box Bayesian inference for agent-based models by Dyer, J, Cannon, P, Farmer, J, Schmon, S

“…Simulation models, in particular agent-based models, are gaining popularity in economics and the social sciences. …”

Solving product-mix markets and learning agents’ preferences by Lock, E

“…It introduces a novel bidding language, which allows agents to submit sealed-bid strong-substitutes preferences over an arbitrary number of goods available in multiple discrete units. …”

Truthful fair division without free disposal by Bei, X, Huzhang, G, Suksompong, W

“…We study the problem of fairly dividing a heterogeneous resource, commonly known as cake cutting and chore division, in the presence of strategic agents. While a number of results in this setting have been established in previous works, they rely crucially on the free disposal assumption, meaning that the mechanism is allowed to throw away part of the resource at no cost. …”

When do envy-free allocations exist? by Manurangsi, P, Suksompong, W

“…We consider a fair division setting in which m indivisible items are to be allocated among n agents, where the agents have additive utilities and the agents’ utilities for individual items are independently sampled from a distribution. …”

Gradient-free distributed optimization with exact convergence by Pang, Yipeng, Hu, Guoqiang

“…In this paper, a gradient-free distributed algorithm is introduced to solve a set constrained optimization problem under a directed communication network. …”
Get full text

Gluten-free extruded products: a review by Paykary, Maryam, Karim, Roselina, Aghazadeh, M., Kazemi, M.

“…This review discusses on production of gluten free food products using extruder. High starch, high protein, and high fiber gluten free food products and their physical, chemical, rheological and sensory properties were compared to that of gluten based material. …”
Get full text

A stain-free detection system for electrophoresis by Yilmaz, Namik Kemal, 1975-

Get full text