相关论文: Computing Minimum Tile Sets to Self-Assemble Color…

Developing critical components, such as mission controllers or embedded systems, is a challenging task. Reactive synthesis is a technique to automatically produce correct controllers. Given a high-level specification written in LTL,…

An ordered set $S$ of vertices of a graph $G$ is a resolving set for $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of G is the minimum cardinality of a resolving set. In…

Let $G$ be a graph that admits a perfect matching. A {\sf forcing set} for a perfect matching $M$ of $G$ is a subset $S$ of $M$, such that $S$ is contained in no other perfect matching of $G$. This notion originally arose in chemistry in…

The design of phased arrays able to generate arbitrary-shaped beams through a sub-arrayed architecture is addressed here. The synthesis problem is cast in the excitation matching framework, so as to yield clustered phased arrays providing…

We study a natural geometric variant of the classic Knapsack problem called 2D-Knapsack: we are given a set of axis-parallel rectangles and a rectangular bounding box, and the goal is to pack as many of these rectangles inside the box…

Process Planning and Scheduling (PPS) is an essential and practical topic but a very intractable problem in manufacturing systems. Many research use iterative methods to solve such problems; however, they cannot achieve satisfactory results…

Template matching is a basic method in image analysis to extract useful information from images. In this paper, we suggest a new method for pattern matching. Our method transform the template image from two dimensional image into one…

The purpose of this paper is to give the flavor of the subject of self-similar tilings in a relatively elementary setting, and to provide a novel method for the construction of such polygonal tilings.

We prove NP-hardness and #P-hardness of Tetris clearing (clearing an initial board using a given sequence of pieces) with the Super Rotation System (SRS), even when the pieces are limited to any two of the seven Tetris piece types. This…

One of the essential issues in decision problems and preference modeling is the number of comparisons and their pattern to ask from the decision maker. We focus on the optimal patterns of pairwise comparisons and the sequence including the…

Adapting large pre-trained models (PTMs) through fine-tuning imposes prohibitive computational and storage burdens. Recent studies of parameter-efficient tuning (PET) find that only optimizing a small portion of parameters conditioned on…

Safe Rust guarantees memory safety through strict compile-time constraints: ownership can be transferred, borrowing can temporarily guarantee either shared read-only or exclusive write access, and ownership and borrowing are scoped by…

Consider a two-player game between players Builder and Painter. Painter begins the game by picking a coloring of the edges of $K_n$, which is hidden from Builder. In each round, Builder points to an edge and Painter reveals its color.…

Almost every software system provides configuration options to tailor the system to the target platform and application scenario. Often, this configurability renders the analysis of every individual system configuration infeasible. To…

In a connected simple graph G = (V(G),E(G)), each vertex is assigned one of c colors, where V(G) can be written as a union of a total of c subsets V_{1},...,V_{c} and V_{i} denotes the set of vertices of color i. A subset S of V(G) is…

The analysis of metrological agents for the estimation of the quality of telecommunication path treatments is carried out. Analysis of subjective and objective estimation methods is presented. The justification for choosing an objective…

Let G be a simple connected graph with vertex set V(G) and edge set E(G. Each vertex of V(G) is colored by a color from the set of colors {c_1, c_2,\dots, c_{\alpha}}. We take a subset S of V(G), such that for every vertex v in V(G)\S, at…

Planar ornaments, a.k.a. wallpapers, are regular repetitive patterns which exhibit translational symmetry in two independent directions. There are exactly $17$ distinct planar symmetry groups. We present a fully automatic method for…

Papadimitriou and Yannakakis show that the polynomial-time solvability of a certain singleobjective problem determines the class of multiobjective optimization problems that admit a polynomial-time computable $(1+\varepsilon, \dots ,…

Parquetry is the art and craft of decorating a surface with a pattern of differently colored veneers of wood, stone or other materials. Traditionally, the process of designing and making parquetry has been driven by color, using the texture…