نتایج جستجو برای: constrained policy graph cpg
تعداد نتایج: 542087 فیلتر نتایج به سال:
Abs t rac t . In graph representations of objects, geometric information is typically lost. This has forced researchers to use graph matching techniques that are intended to handle general graphs. By encoding the lost geometric information into graph representations, however, we can apply more efficient algorithms for constrained graphs. In this paper we introduce an edge ordering property that...
Identification of active constraints in constrained optimization is of interest from both practical and theoretical viewpoints, as it holds the promise of reducing an inequality-constrained problem to an equality-constrained problem, in a neighborhood of a solution. We study this issue in the more general setting of composite nonsmooth minimization, in which the objective is a composition of a ...
We derive the equilibrium institutional design of representative democracy by citizens who first vote on the supermajority required for a new policy to be adopted, and then delegate decision making to a legislature that selects policy given that institutional constraint. A legislature that can freely tailor policy to reflect society’s current preferences is good. However, the views of the media...
New approaches to solving underconstrained and inconsistent overconstrained 3D geometric models are described. When a model is found to be underconstrained, the underconstrained parts of the model are determined and shown to the user. The user has to add constraints to these parts, to make the model well-constrained. When an inconsistency in the model is found, the set is determined of the cons...
We present experiments that analyze the necessity of using a highly interconnected word/sense graph for unsupervised allwords word sense disambiguation. We show that allowing only grammatically related words to influence each other’s senses leads to disambiguation results on a par with the best graph-based systems, while greatly reducing the computation load. We also compare two methods for com...
We introduce and study a combinatorial problem called preference-constrained oriented matching. This problem is defined on a directed graph in which each node has preferences over its out-neighbors, and the goal is to find a maximum-size matching on this graph that satisfies a certain preference constraint. One of our main results is a structural theorem showing that if the given graph is compl...
In recent years, multi-agent reinforcement learning (MARL) has presented impressive performance in various applications. However, physical limitations, budget restrictions, and many other factors usually impose constraints on a system (MAS), which cannot be handled by traditional MARL frameworks. Specifically, this paper focuses constrained MASes where agents work cooperatively to maximize the ...
We outline a theory to quantify the interplay of entropic and selective forces on nucleotide organization and apply it to the genomes of single-stranded RNA viruses. We quantify these forces as intensive variables that can easily be compared between sequences, outline a computationally efficient transfer-matrix method for their calculation, and apply this method to influenza and HIV viruses. We...
Human aging cannot be fully understood in terms of the constrained genetic setting. Epigenetic drift is an alternative means of explaining age-associated alterations. To address this issue, we performed whole-genome bisulfite sequencing (WGBS) of newborn and centenarian genomes. The centenarian DNA had a lower DNA methylation content and a reduced correlation in the methylation status of neighb...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید