Publication
Stable Fractional Matchings
Related publications (67)
A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving
Richard Lee Davis, Engin Walter Bumbacher, Jérôme Guillaume Brender
How to measure students' Computational Problem-Solving (CPS) competencies is an ongoing research topic. Prevalent approaches vary by measurement tools (e.g., interactive programming, multiple-choice tests, or programming-independent tests) and task types ( ...
Association for Computing Machinery2024Combinatory Array Logic with Sums
We prove an NP upper bound on a theory of integer-indexed integer-valued arrays that extends combi- natory array logic with an ordering relation on the index set and the ability to express sums of elements. We compare our fragment with seven other fragment ...
2023Why computational complexity may set impenetrable barriers for epistemic reductionism
Michael Herzog, Christian Sachse, Adrien Christophe Doerig
According to physicalism, everything is physical or metaphysically connected to the physical. If physicalism were true, it seems that we should - in principle - be able to reduce the descriptions and explanations of special sciences to physical ones, for e ...
Dordrecht2023Minimum Cost Intervention Design for Causal Effect Identification
Negar Kiyavash, Sina Akbari, Seyed Jalal Etesami
Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the ...
PMLR2022ExG Signal Feature Selection Using Hyperdimensional Computing Encoding
David Atienza Alonso, Tomas Teijeiro Campo, Una Pale
Wearable IoT devices and novel continuous monitoring algorithms are essential components of the healthcare transition from reactive interventions focused on symptom treatment to more proactive prevention, from one-size-fits-all to personalized medicine, an ...
IEEE2022Computation Complexity Reduction Technique for Accurate Seizure Detection Implants
Alexandre Schmid, Keyvan Farhang Razi
An automatic seizure detection method from high-resolution intracranial-EEG (iEEG) signals is presented to minimize the computational complexity and realize real-time accurate seizure detection for biomedical implants. Complex signal processing on a large ...
IEEE2022Proofs, Circuits, and Communication
We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of total search prob ...
2022Roundtable Panel Discussion at DAC 2019: Evolutionary Computing or Heuristic Forever?
Giovanni De Micheli, Massimiliano Di Ventra
As demands for computing have been continuously increasing, various solutions have been proposed. Some approaches deal with improving algorithms and software programs, mainly through the tuning of advanced heuristics and learning methods. Some other tackle ...
2020Iterative distributed fault detection and isolation for linear systems based on moving horizon estimation
René Uwe Schneider, Marcello Farina
In modern engineering systems, reliability and safety can be conferred by efficient automatic monitoring and fault detection algorithms, allowing for the early identification and isolation of incipient faults. In case of large-scale and complex systems, sc ...
2020Contextual Games: Multi-Agent Learning with Side Information
Maryam Kamgarpour, Andreas Krause, Ilija Bogunovic
We formulate the novel class of contextual games, a type of repeated games driven by contextual information at each round. By means of kernel-based regularity assumptions, we model the correlation between different contexts and game out- comes and propose ...
Curran Associates, Inc.2020