نتایج جستجو برای: binary programming

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

2007
Benjamin Bustos Nelson Morales

A recent trend to improve the effectiveness of similarity queries in multimedia databases is based on dynamic combinations of metric spaces. The efficiency issue when using these dynamic combinations is still an open problem, especially in the case of binary weights. Our solution resorts to the use of a set of indices. We describe a binary linear program that finds the optimal set of indices gi...

2018
Tianlin Liu Dae Gwan Lee

We present a fast Compressive Sensing algorithm for the reconstruction of binary signals {0, 1}-valued binary signals from its linear measurements. The proposed algorithm minimizes a non-convex penalty function that is given by a weighted sum of smoothed l0 norms, under the [0, 1] box-constraint. It is experimentally shown that the proposed algorithm is not only significantly faster than linear...

1998
Stefan Nilsson Matti Tikkanen

We present an order-preserving general purpose data structure for binary data, the LPC-trie. The structure is a highly compressed trie, using both level and path compression. The memory usage is similar to that of a balanced binary search tree, but the expected average depth is smaller. The LPC-trie is well suited to modern language environments with eecient memory allocation and garbage collec...

1999
Vasanth Bala Evelyn Duesterwald Sanjeev Banerjia

dynamic optimization, compiler, trace selection, binary translation Dynamic optimization refers to the runtime optimization of a native program binary. This report describes the design and implementation of Dynamo, a prototype dynamic optimizer that is capable of optimizing a native program binary at runtime. Dynamo is a realistic implementation, not a simulation, that is written entirely in us...

Journal: :journal of optimization in industrial engineering 2011
samareh moradpour sadoullah ebrahimnejad esmaeil mehdizadeh arash mohamadi

multi attribute decision making methods are considered as one of the most useful methods for solving ranking problems. in some decision making problems, while the alternatives for corresponding criteria are compared in a pairwise comparison manner, if the criteria are inherently fuzzy, debates will arise in ranking alternatives due to the closeness of the values of the criteria. in this researc...

Journal: :مهندسی صنایع 0
سیما غایب لو دانشجوی دکتری مهندسی صنایع دانشگاه صنعتی خواجه نصیرالدین طوسی محمد جعفر تارخ دانشیار دانشکدة مهندسی صنایع دانشگاه صنعتی خواجه نصیرالدین طوسی

closed-loop supply chain network (clscn) design aims at incorporating environmental considerations into the traditional supply chain design by including recycling, disassembly and reuse activities. in a clscn, the environmental considerations can also be facilitated by resorting to environmentally friendly materials and enhancing product reuse through the design of an appropriate product recove...

Journal: :Electronic Notes in Discrete Mathematics 2010
Fethi Jarray Ghassen Tlig

We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two projections. This variant is reformulated as an integer programming problem and approximated by simulated annealing approach.

Multi attribute decision making methods are considered as one of the most useful methods for solving ranking problems. In some decision making problems, while the alternatives for corresponding criteria are compared in a pairwise comparison manner, if the criteria are inherently fuzzy, debates will arise in ranking alternatives due to the closeness of the values of the criteria. In this researc...

Seyed Hamidreza Pasandideh, Seyed Mohsen Mousavi

In this article, a finite horizon, multi product and multi period economic order quantity like seasonal items is considered where demand rate is deterministic and known but variable in each period. The order quantities of items come in batch sizes and the end of the period order quantity and, consequently, demand of customers are zero. In addition, storage space is constrained and the problem...

Credit scoring is a kind of binary classification problem that contains important information for manager to make a decision in particularly in banking authorities. Obtained scores provide a practical credit decision for a loan officer to classify clients to reject or accept for payment loan. For this sake, in this paper a data envelopment analysis- discriminant analysis (DEA-DA) approach is us...

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

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