Search Results for author:
Found 7 papers, 0 papers with code
Distributed course allocation with asymmetric friendships
Students' decisions on whether to take a class are strongly affected by whether their friends plan to take the class with them.
Efficient One Sided Kolmogorov Approximation
We present an efficient algorithm that, given a discrete random variable $X$ and a number $m$, computes a random variable whose support is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal, also for the one-sided Kolmogorov approximation.
Evaluation of Neural Networks Defenses and Attacks using NDCG and Reciprocal Rank Metrics
In this paper, we present two metrics which are specifically designed to measure the effect of attacks, or the recovery effect of defenses, on the output of neural networks in multiclass classification tasks.
Heat and Blur: An Effective and Fast Defense Against Adversarial Examples
The growing incorporation of artificial neural networks (NNs) into many fields, and especially into life-critical systems, is restrained by their vulnerability to adversarial examples (AEs).
Coalitional Games with Stochastic Characteristic Functions and Private Types
The research on coalitional games has focused on how to share the reward among a coalition such that players are incentivised to collaborate together.
Asymmetric Distributed Constraint Optimization Problems
Innovative algorithms that apply to the special properties of the proposed ADCOP model are presented in detail.
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs).
