Zobrazeno 1 - 10
of 166
pro vyhledávání: '"Guns, Tias"'
Autor:
Mandi, Jayanta, Foschini, Marco, Holler, Daniel, Thiebaux, Sylvie, Hoffmann, Jorg, Guns, Tias
In many automated planning applications, action costs can be hard to specify. An example is the time needed to travel through a certain road segment, which depends on many factors, such as the current weather conditions. A natural way to address this
Externí odkaz:
http://arxiv.org/abs/2408.06876
Constraint Programming (CP) has been successfully used to model and solve complex combinatorial problems. However, modeling is often not trivial and requires expertise, which is a bottleneck to wider adoption. In Constraint Acquisition (CA), the goal
Externí odkaz:
http://arxiv.org/abs/2312.10795
Autor:
Mahmutoğulları, Ali İrfan, Guns, Tias
We investigate the benefit of using contextual information in data-driven demand predictions to solve the robust capacitated vehicle routing problem with time windows. Instead of estimating the demand distribution or its mean, we introduce contextual
Externí odkaz:
http://arxiv.org/abs/2310.17368
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:
Mandi, Jayanta, Kotary, James, Berden, Senne, Mulamba, Maxime, Bucarey, Victor, Guns, Tias, Fioretto, Ferdinando
Publikováno v:
Journal of Artificial Intelligence Research 81 (2024) 1623-1701
Decision-focused learning (DFL) is an emerging paradigm that integrates machine learning (ML) and constrained optimization to enhance decision quality by training ML models in an end-to-end system. This approach shows significant potential to revolut
Externí odkaz:
http://arxiv.org/abs/2307.13565
Constraint Acquisition (CA) systems can be used to assist in the modeling of constraint satisfaction problems. In (inter)active CA, the system is given a set of candidate constraints and posts queries to the user with the goal of finding the right co
Externí odkaz:
http://arxiv.org/abs/2307.06126
Autor:
Silvestri, Mattia, Berden, Senne, Mandi, Jayanta, Mahmutoğulları, Ali İrfan, Amos, Brandon, Guns, Tias, Lombardi, Michele
Many real-world optimization problems contain parameters that are unknown before deployment time, either due to stochasticity or to lack of information (e.g., demand or travel times in delivery problems). A common strategy in such cases is to estimat
Externí odkaz:
http://arxiv.org/abs/2307.05213
We build on a recently proposed method for stepwise explaining solutions of Constraint Satisfaction Problems (CSP) in a human-understandable way. An explanation here is a sequence of simple inference steps where simplicity is quantified using a cost
Externí odkaz:
http://arxiv.org/abs/2303.11712
A major bottleneck in search-based program synthesis is the exponentially growing search space which makes learning large programs intractable. Humans mitigate this problem by leveraging the compositional nature of the real world: In structured domai
Externí odkaz:
http://arxiv.org/abs/2301.03094
Autor:
Teso, Stefano, Bliek, Laurens, Borghesi, Andrea, Lombardi, Michele, Yorke-Smith, Neil, Guns, Tias, Passerini, Andrea
It is increasingly common to solve combinatorial optimisation problems that are partially-specified. We survey the case where the objective function or the relations between variables are not known or are only partially specified. The challenge is to
Externí odkaz:
http://arxiv.org/abs/2205.10157