Management Science, Vol. 34, No. 3, Focussed Issue on Heuristics (Mar., 1988), pp. 402-410 (9 pages) A new approximate algorithm for multidimensional zero-one knapsack problems with all positive ...
Tech Xplore on MSN
Approximate domain unlearning: Enabling safer and more controllable vision-language models
Vision-language model (VLM) is a core technology of modern artificial intelligence (AI), and it can be used to represent ...
Unlock the full InfoQ experience by logging in! Stay updated with your favorite authors and topics, engage with content, and download exclusive resources. In this article, author Elakkiya Daivam ...
A monthly overview of things you need to know as an architect or aspiring architect. Unlock the full InfoQ experience by logging in! Stay updated with your favorite authors and topics, engage with ...
In this paper, we consider the scheduling problem of minimising the total weighted job completion time when a set of jobs must be processed on m parallel machines with a single server. This problem ...
Quantum optimization team: from left to right are Kilian Ender, Clemens Dlaska, Wolfgang Lechner, Rick van Bijnen, Andreas Kruckenhauser and Glen Bigan Mbeng Quantum computers are often discussed as a ...
The traveling salesman problem is one of the basic problems that many theoretical computer scientists have been working on. Many scientists think that there is no algorithm for the traveling salesman ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback