Concept

Assignment (computer science)

Related publications (7)

A parallel and distributed approach for diversified top-k best region search

Given a set of points, the Best Region Search problem finds the optimal location of a rectangle of a specified size such that the value of a user-defined scoring function over its enclosed points is maximized. A recently proposed top-k algorithm for this problem returns results progressively, while also incorporating additional constraints, such as taking into consideration the overlap between the set of selected top-k rectangles. However, the algorithm is designed for a centralized setting and does not sca

OpenProceedings2020

The SIGMOD 2019 research track reviewing system

While organizing the submission evaluation process for the SIGMOD 2019 research track, we aim at maximizing the value of the reviews while minimizing the probability of misunderstandings due to factual errors, thereby valorizing impactful ideas. The objective is an educating and rewarding experience for both the authors and the reviewers. The actionable goals are: 1. Maximize review depth and breadth. For depth, optimizing the assignment of papers to reviewers is of key importance; "low confidence" reviews

Association for Computing Machinery2019

Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior

Boi Faltings, Aris Filos Ratsikas, Panayiotis Danassis

We present a novel anytime heuristic (ALMA), inspired by the human principle of altruism, for solving the assignment problem. ALMA is decentralized, completely uncoupled, and requires no communication between the participants. We prove an upper bound on th ...

2019

Exploring students learning approaches in MOOCs

This study aims at understanding different students approaches for solving assignments in MOOCs. It makes use of a large dataset of logs from students interaction with the MOOC platform Coursera on a course about functional programming with Scala. In total more than 10.000 students participated in the assignments. Learning approaches are divided in two categories: starting with video lectures (V) and start- ing with the assignment (A); and students are divided in three groups: those applying purely the appr

2017

Assignment Techniques for Crowdsourcing Sensitive Tasks

Laura Elisa Celis

Protecting the privacy of crowd workers has been an important topic in crowdsourcing, however, task privacy has largely been ignored despite the fact that many tasks, e.g., form digitization, live audio transcription or image tagging often contain sensitiv ...

Assoc Computing Machinery2016

Common Subexpression Elimination in Dotty

Martin Odersky

Common subexpression elimination is a well-known compiler optimisa- tion that improves running time of compiled applications by avoiding the repetition of the same computation. Although it has been implemented on a low level such as bytecode, it misses multiple opportunities that are available on high level, such as optimizing lazy vals. We developed and implemented the transformation for Scala in a new mini-phase in the Dotty Compiler.

2015

Majority logic synthesis

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

A method for optimizing an implementation of a logic circuit, comprising steps of providing an interpretation of the logic circuit in terms of 3 Boolean variable majority operators M, with each of the majority operators being a function of a plurality of v ...

2015

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Related publications (7)