نتایج جستجو برای: α cuts
تعداد نتایج: 177598 فیلتر نتایج به سال:
در این تحقیق سنتز و شناسایی پیرازولو پیریدین¬ها و آرن های چند عاملی، از یک واکنش چند جزیی میان دی سیانو آلکن¬ها، هیدرازین و سیانو کیتین دی تیو استال¬ها در دمای 25 درجه سانتیگراد و حلال اتانول انجام شده است. سپس جهت گسترش دامنه تحقیقات، سنتز و شناسایی برخی هتروسیکل¬ها با استفاده از α،α- دی سیانو الفین¬ها (آریل اتیلیدن مالونونیتریل¬ها) مورد بررسی قرار گرفت. در این تحقیق، واکنش سه جزئی شا...
Let G= (V,E,σ,μ) be a simple connected undirected fuzzy graph. In this paper, we use a fuzzy graph model to represent a traffic network of a city and discuss a method to find the different type of accidental zones in a traffic flows. Depending on the possibility of accident, this paper classifies accidental zone of a traffic flow into three type’s namely α-strong, β-strong and δ-strong accident...
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E) where V and E denote the sensors deployed in the plane and the links among them, respectively. A link between two sensors exists if their Euclidean distance is at most 1. We present a distributed algorithm that compu...
Summarizing the whole support of a random variable into minimum volume sets of its probability density function is studied in the paper. We prove that the level sets of a probability density function correspond to minimum volume sets and also determine the conditions for which the inverse proposition is verified. The distribution function of the level cuts of a density function is also introduc...
We present an accurate and efficient stereo matching method using local expansion moves, a new move making scheme using graph cuts. The local expansion moves are presented as many α-expansions defined for small grid regions. The local expansion moves extend the traditional expansion moves by two ways: localization and spatial propagation. By localization, we use different candidate α-labels acc...
This tutorial presents a theory of valid inequalities for mixed integer linear sets. It introduces the necessary tools from polyhedral theory and gives a geometric understanding of several classical families of valid inequalities such as lift-and-project cuts, Gomory mixed integer cuts, mixed integer rounding cuts, split cuts and intersection cuts, and it reveals the relationships between these...
We explore the idea of obtaining valid inequalities from a finite-domain formulation of a problem, rather than a 0-1 formulation. A finite-domain model represents discrete choices with variables that have several possible values, as is frequently done in constraint programming. We apply the idea to graph coloring and identify facet-defining cuts that, when converted to cuts in a 0-1 model of th...
Gomory mixed-integer cuts are an important ingredient in state-ofthe-art software for solving mixed-integer linear programs. In particular, much attention has been paid to the strengthening of these cuts. In this paper, we give an overview of existing approaches for improving the performance of Gomory mixed-integer cuts. More precisely, we consider k-cuts, combined Gomory mixed-integer cuts, re...
We explore the idea of obtaining valid inequalities for a 0-1 model from a constraint programming formulation of the problem. In particular, we formulate a graph coloring problem as a system of alldifferent constraints. By analyzing the polyhedral structure of alldiff systems, we obtain facet-defining inequalities that can be mapped to valid cuts in the classical 0-1 model of the problem. We fo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید