نتایج جستجو برای: minimum ordering
تعداد نتایج: 199971 فیلتر نتایج به سال:
We study hardness of approximating several minimaximal and maximinimal NP-optimization problems related to the minimum linear ordering problem (MINLOP). MINLOP is to find a minimum weight acyclic tournament in a given arc-weighted complete digraph. MINLOP is APX-hard but its unweighted version is polynomial time solvable. We prove that, MIN-MAX-SUBDAG problem, which is a generalization of MINLO...
We study a perishable inventory system that requires to maintain a fresh and large quantity of inventory at all times. For example, certain pharmaceuticals are kept for emergency preparedness and response operations. We aim to maximize the profit by optimizing the joint problem of the ordering and issuing policies while maintaining a minimum amount of perishable inventory. First, we consider a ...
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitions. We consider ID-logic theories that express, at the same time, the two basic challenges in database composition problems: relating different schemas of the local databases to one global schema (schema integration) a...
The all-time behavior provides a robustness algorithm by allowing it to be interrupted at any point in the process, while ensuring that the best possible response is delivered when the stop request occurs. This work proposes a methodology to identify the relationship of the parameters of an optimization algorithm by colony of ants with its behavior at-all-moment, allowing to implement a techniq...
Since innovation plays an important role in the context of food, as evident in how successful chefs, restaurants or cuisines in general evolve over time, we were interested in exploring this dimension from a more virtual perspective. In particular, the paper presents results of a study that was conducted in the context of a large-scale German online food community forum to explore another impor...
Filled skutterudites are high-performance thermoelectric materials and we show how their phonon conductivity is greatly influenced by the topology of the filler species. We predict (ab initio) the phase diagram of Ba(x)Co4Sb12 and find several stable configurations of Ba ordering over the intrinsic voids. The phonon conductivity predicted using molecular dynamics shows a minimum in the two-phas...
This paper addresses a mixed integer programming (MIP) formulation for the multi-item uncapacitated lot-sizing problem that is inspired from the trailer manufacturer. The proposed MIP model has been utilized to find out the optimum order quantity, optimum order time, and the minimum total cost of purchasing, ordering, and holding over the predefined planning horizon. This problem is known as NP...
This paper presents NTT-NAIST SMT systems for EnglishGerman and German-English MT tasks of the IWSLT 2013 evaluation campaign. The systems are based on generalized minimum Bayes risk system combination of three SMT systems: forest-to-string, hierarchical phrase-based, phrasebased with pre-ordering. Individual SMT systems include data selection for domain adaptation, rescoring using recurrent ne...
......................................................................................................................................................ii TABLE OF CONTENTS ......................................................................................................................iii CHAPTER 1: INTRODUCTION AND MOTIVATION.....................................................................
This paper describes details of the NTT-UT system in NTCIR9 PatentMT task. One of its key technology is system combination; the final translation hypotheses are chosen from n-bests by different SMT systems in a Minimum Bayes Risk (MBR) manner. Each SMT system includes different technology: syntactic pre-ordering, forest-to-string translation, and using external resources for domain adaptation a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید