Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Rudich, Isaac"'
Simple Stochastic Games (SSGs) were introduced by Anne Condon in 1990, as the simplest version of Stochastic Games for which there is no known polynomial-time algorithm. Condon showed that Stochastic Games are polynomial-time reducible to SSGs, which
Externí odkaz:
http://arxiv.org/abs/2402.02571
Autor:
Rudich, Isaac, Cappart, Quentin, López-Ibáñez, Manuel, Römer, Michael, Rousseau, Louis-Martin
Many real-world scenarios involve solving bi-level optimization problems in which there is an outer discrete optimization problem, and an inner problem involving expensive or black-box computation. This arises in space-time dependent variants of the
Externí odkaz:
http://arxiv.org/abs/2312.01404
Publikováno v:
Journal of Artificial Intelligence Research, 77:1489-1538 (2023)
Decision diagrams are an increasingly important tool in cutting-edge solvers for discrete optimization. However, the field of decision diagrams is relatively new, and is still incorporating the library of techniques that conventional solvers have had
Externí odkaz:
http://arxiv.org/abs/2302.05483
Publikováno v:
28th International Conference on Principles and Practice of Constraint Programming (CP 2022): 235:1-235:20
Decision diagrams are an increasingly important tool in cutting-edge solvers for discrete optimization. However, the field of decision diagrams is relatively new, and is still incorporating the library of techniques that conventional solvers have had
Externí odkaz:
http://arxiv.org/abs/2205.05216