中文
相关论文

相关论文: A Computer Composes A Fabled Problem: Four Knights…

200 篇论文

In fine art, especially painting, humans have mastered the skill to create unique visual experiences through composing a complex interplay between the content and style of an image. Thus far the algorithmic basis of this process is unknown…

计算机视觉与模式识别 · 计算机科学 2015-09-03 Leon A. Gatys , Alexander S. Ecker , Matthias Bethge

Solving inverse problems is a fundamental component of science, engineering and mathematics. With the advent of deep learning, deep neural networks have significant potential to outperform existing state-of-the-art, model-based methods for…

机器学习 · 计算机科学 2022-12-22 Maksym Neyra-Nesterenko , Ben Adcock

We show that deep convolutional neural networks (CNN) can massively outperform traditional densely-connected neural networks (both deep or shallow) in predicting eigenvalue problems in mechanics. In this sense, we strike out in a new…

计算物理 · 物理学 2018-07-19 David Finol , Yan Lu , Vijay Mahadevan , Ankit Srivastava

Design of cyber-physical systems (CPSs) is a challenging task that involves searching over a large search space of various CPS configurations and possible values of components composing the system. Hence, there is a need for…

机器学习 · 计算机科学 2020-09-28 Prerit Terway , Kenza Hamidouche , Niraj K. Jha

Deep neural networks (DNNs) have achieved remarkable success in various tasks (e.g., image classification, speech recognition, and natural language processing (NLP)). However, researchers have demonstrated that DNN-based models are…

计算与语言 · 计算机科学 2021-04-22 Wenqi Wang , Run Wang , Lina Wang , Zhibo Wang , Aoshuang Ye

The disjunctively constrained knapsack problem consists in packing a subset of pairwisely compatible items in a capacity-constrained knapsack such that the total profit of the selected items is maximized while satisfying the knapsack…

神经与进化计算 · 计算机科学 2021-01-14 Zequn Wei , Jin-Kao Hao

Quantum computers have long been more of a toy for researchers than a tool for solving complex problems. However, recent advances in the field make exploiting the advantages of fault-tolerant quantum computers feasible in the next 5 to 10…

量子物理 · 物理学 2025-08-14 Daniel Bultrini , James Wootton

Current Dynamic Texture Synthesis (DyTS) models can synthesize realistic videos. However, they require a slow iterative optimization process to synthesize a single fixed-size short video, and they do not offer any post-training control over…

计算机视觉与模式识别 · 计算机科学 2023-04-03 Ehsan Pajouheshgar , Yitao Xu , Tong Zhang , Sabine Süsstrunk

Existing captcha solutions on the Internet are a major source of user frustration. Game captchas are an interesting and, to date, little-studied approach claiming to make captcha solving a fun activity for the users. One broad form of such…

Neural Architecture Search has achieved state-of-the-art performance in a variety of tasks, out-performing human-designed networks. However, many assumptions, that require human definition, related with the problems being solved or the…

机器学习 · 计算机科学 2020-08-03 Vasco Lopes , Luís A. Alexandre

Network Control Systems (NCSs) pose unique vulnerabilities to cyberattacks due to a heavy reliance on communication channels. These channels can be susceptible to eavesdropping, false data injection (FDI), and denial of service (DoS). As a…

系统与控制 · 电气工程与系统科学 2022-11-11 Omanshu Thapliyal , Inseok Hwang

Existing approaches for automatically generating mathematical word problems are deprived of customizability and creativity due to the inherent nature of template-based mechanisms they employ. We present a solution to this problem with the…

计算与语言 · 计算机科学 2019-12-04 Vijini Liyanage , Surangika Ranathunga

The problem of decomposing an arbitrary Clifford element into a sequence of Clifford gates is known as Clifford synthesis. Drawing inspiration from similarities between this and the famous Rubik's Cube problem, we develop a machine learning…

量子物理 · 物理学 2024-03-12 Ning Bao , Gavin S. Hartnett

A tournament is an orientation of a complete graph. A vertex that can reach every other vertex within two steps is called a \emph{king}. We study the complexity of finding $k$ kings in a tournament graph. We show that the randomized query…

数据结构与算法 · 计算机科学 2024-10-15 Amir Abboud , Tomer Grossman , Moni Naor , Tomer Solomon

Dynamic games are powerful tools to model multi-agent decision-making, yet computing Nash (generalized Nash) equilibria remains a central challenge in such settings. Complexity arises from tightly coupled optimality conditions, nested…

计算机科学与博弈论 · 计算机科学 2026-02-06 Mahdis Rabbani , Navid Mojahed , Shima Nazari

Capacitated network bargaining games are popular combinatorial games that involve the structure of matchings in graphs. We show that it is always possible to stabilize unit-weight instances of this problem (that is, ensure that they admit a…

离散数学 · 计算机科学 2024-09-05 Laura Sanità , Lucy Verberk

Deep Neural Networks (DNNs) have improved the accuracy of classification problems in lots of applications. One of the challenges in training a DNN is its need to be fed by an enriched dataset to increase its accuracy and avoid it suffering…

机器学习 · 计算机科学 2020-08-25 Iman Saberi , Fathiyeh Faghih

Computational aspects of solution notions such as Nash equilibrium have been extensively studied, including settings where the ultimate goal is to find an equilibrium that possesses some additional properties. Furthermore, in order to…

计算复杂性 · 计算机科学 2023-05-09 Bruce M. Kapron , Koosha Samieefar

To advance from passive retrieval to creative discovery of new ideas, autonomous agents must be capable of deep, associative synthesis. However, current agentic frameworks prioritize convergent search, often resulting in derivative…

信息检索 · 计算机科学 2026-05-11 Jason Liang , Elliot Meyerson , Risto Miikkulainen

In this paper, we establish that for a wide class of controlled stochastic differential equations (SDEs) with stiff coefficients, the value functions of corresponding zero-sum games can be represented by a deep artificial neural network…

数值分析 · 数学 2020-05-14 Christoph Reisinger , Yufei Zhang