نتایج جستجو برای: constraint elimination method

تعداد نتایج: 1736270  

Journal: :caspian journal of mathematical sciences 2015
m. eslami

this paper studies the generalized version of thezakharov-kuznetsov benjamin-bona-mahoney equation. the functionalvariable method as well as the simplest equation method areapplied to obtain solitons and singular periodic solutions to theequation. there are several constraint conditions that arenaturally revealed in order for these specialized type ofsolutions to exist. the results of this pape...

1998
Roman Barták

Constraint hierarchies have been proposed to describe over-constraint systems of constraints by specifying constraints with hierarchical preferences, i.e., hard and soft constraints. While the hard (required) constraints must hold, the soft (preferential) constraints should be satisfied as much as possible depending on the criterion used. Currently, constraint hierarchies are mostly applied to ...

Journal: :تحقیقات مالی 0
ابراهیم عباسی استادیار مدیریت مالی، دانشکدۀ علوم اجتماعی و اقتصاد، دانشگاه الزهرا، تهران، ایران مریم شریفی کارشناس‎ارشد حسابداری، دانشکدۀ مدیریت و اقتصاد، دانشگاه آزاد اسلامی واحد علوم و تحقیقات، تهران، ایران

the objective of this study is to examine the effect of mispricing on firm’s investment behavior and capital structure. it also tests the role of the level of financial constraints in the relationship between mispricing , investment and capital structure. using data of 110 firms of tehran stock exchang from 1384-1389, results indicated that mispricing has negative impact to firms investment. ho...

This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...

Journal: :Remote Sensing 2023

Shadow detection is a new method for video synthetic aperture radar moving target indication (ViSAR-GMTI). The shadow formed by the occlusion will reflect its real position, preventing defocusing or offset of from making it difficult to identify during imaging. To achieve high-precision detection, this paper proposes SAR shadow-detection algorithm based on low-rank sparse decomposition combined...

M. Beigi V. R. Ghezavati

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...

Inversion of magnetic data is an important step towards interpretation of the practical data. Smooth inversion is a common technique for the inversion of data. Physical bound constraint can improve the solution to the magnetic inverse problem. However, how to introduce the bound constraint into the inversion procedure is important. Imposing bound constraint makes the magnetic data inversion a n...

2006
Robert Mateescu Rina Dechter

Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function decomposition structure. This yields AND/OR multivalued decision diagram (AOMDD) which compiles a constraint network into a canonical form that supports polynomial time queries such as solution counting, solution enumeration or e...

1998
Thomas H. Kolbe

In this paper we will show how constraint solving methods can be applied for the recognition of buildings in aerial images. Object models are transformed to constraint representations which are matched against extracted image features. To cope with disturbances caused by occlusions and noise, we distinguish between the unobservability of a) relations between object parts and b) object parts the...

1998
Roman Barták

Constraint hierarchies have been proposed to describe over-constrained systems of constraints by specifying constraints with hierarchical preferences, i.e., hard and soft constraints. While the hard (required) constraints must hold, the soft (preferential) constraints should be satisfied as much as possible depending on the criterion used. Currently, constraint hierarchies are mostly applied to...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید