Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Kadioglu, Serdar"'
Autor:
Kadioglu, Serdar, Michalsky, Filip
The acceleration in the adoption of AI-based automated decision-making systems poses a challenge for evaluating the fairness of algorithmic decisions, especially in the absence of ground truth. When designing interventions, uplift modeling is used ex
Externí odkaz:
http://arxiv.org/abs/2403.12069
Autor:
Kadıoğlu, Serdar, Kleynhans, Bernard
The goal of this paper is to share our experience in designing and organizing educational competitions with anonymous and (near) real-time leaderboards in both academic and industrial settings. While such competitions serve as a great educational too
Externí odkaz:
http://arxiv.org/abs/2402.07936
Twenty-seven years ago, E. Freuder highlighted that "Constraint programming represents one of the closest approaches computer science has yet made to the Holy Grail of programming: the user states the problem, the computer solves it". Nowadays, CP us
Externí odkaz:
http://arxiv.org/abs/2308.01589
Autor:
Rosenberg, Gili, Brubaker, J. Kyle, Schuetz, Martin J. A., Salton, Grant, Zhu, Zhihuai, Zhu, Elton Yechao, Kadıoğlu, Serdar, Borujeni, Sima E., Katzgraber, Helmut G.
We propose and implement an interpretable machine learning classification model for Explainable AI (XAI) based on expressive Boolean formulas. Potential applications include credit scoring and diagnosis of medical conditions. The Boolean formula defi
Externí odkaz:
http://arxiv.org/abs/2306.03976
Autor:
Wang, Xin, Kadioglu, Serdar
We introduce a pattern mining framework that operates on semi-structured datasets and exploits the dichotomy between outcomes. Our approach takes advantage of constraint reasoning to find sequential patterns that occur frequently and exhibit desired
Externí odkaz:
http://arxiv.org/abs/2201.09178
Designing recommendation systems with limited or no available training data remains a challenge. To that end, a new combinatorial optimization problem is formulated to generate optimized item selection for experimentation with the goal to shorten the
Externí odkaz:
http://arxiv.org/abs/2112.03105
We formulate and solve the H-SARA Problem, a Vehicle Routing and Appointment Scheduling Problem motivated by home services management. We assume that travel times, service durations, and customer cancellations are stochastic. We use a two-stage proce
Externí odkaz:
http://arxiv.org/abs/2106.16176
Autor:
Kadioglu, Serdar
This paper proposes a novel column generation framework for combinatorial software testing. In particular, it combines Mathematical Programming and Constraint Programming in a hybrid decomposition to generate covering arrays. The approach allows gene
Externí odkaz:
http://arxiv.org/abs/1712.07081
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Instance-specific algorithm configuration and algorithm portfolios have been shown to offer significant improvements over single algorithm approaches in a variety of application domains. In the SAT and CSP domains algorithm portfolios have consistent
Externí odkaz:
http://arxiv.org/abs/1401.2474