We publish the best academic work (that's too often lost to peer reviews & the TA's desk) to the global tech community ...

Royalty-free licenses let you pay once to use copyrighted images and video clips in personal and commercial projects on an ongoing basis without requiring additional payments each time you use that ...

Abstract: The Steiner Forest Problem is a fundamental combinatorial optimization problem in operations research and computer science. Given an undirected graph with non-negative weights for edges and ...

We study the greedy (exploitation-only) algorithm in bandit problems with a known reward structure. We allow arbitrary finite reward structures, while prior work focused on a few specific ones. We ...

Abstract: An iterated greedy algorithm (IGA) is a simple and powerful heuristic algorithm. It is widely used to solve flow-shop scheduling problems (FSPs), an important branch of production scheduling ...

1 School of Information and Intelligent Engineering, Nantong College of Science and Technology, Nantong, China 2 Faculty of Social, Business and Computer Sciences, Varna Free University, Varna, ...

Machine learning holds the potential to solve many real-world problems, but interpretability is a necessary prerequisite for practitioners in high-stakes domains such as medicine and law. Decision ...