نتایج جستجو برای: yield constraints

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

2000
Andrew J. S. Hamilton

As experimentalists step up their pursuit of cold dark matter particles and neutrino masses, cosmological constraints are tightening. We compute the joint constraints on 11 cosmological parameters from cosmic microwave background and large scale structure data, and find that at 95% confidence, the total (cold+hot) dark matter density is hΩdm = 0.20 +.12 −.10 with at most 38% of it being hot (du...

2008
Pascal Van Hentenryck Laurent D. Michel

Recently, Gargani and Refalo (G&R) presented an elegant model for the Steel Mill Slab Design Problem (Problem 38 in the CSP LIB). Contrary to earlier approaches, their model does not use 0/1 variables but exploits the traditional expressiveness of constraint programming. G&R indicated that static symmetry-breaking constraints proposed earlier are not effective on this model, as these interact w...

Journal: :Artif. Intell. 2017
Jimmy Ho-Man Lee Zichen Zhu

The paper proposes a dynamic method, Recursive Symmetry Breaking During Search (ReSBDS), for efficient partial symmetry breaking. We first demonstrate how Partial Symmetry Breaking During Search (ParSBDS) misses important pruning opportunities when given only a subset of symmetries to break. The investigation pinpoints the culprit and in turn suggests rectification. The main idea is to add extr...

2004
Richard Zens Hermann Ney Taro Watanabe Eiichiro Sumita

In statistical machine translation, the generation of a translation hypothesis is computationally expensive. If arbitrary reorderings are permitted, the search problem is NP-hard. On the other hand, if we restrict the possible reorderings in an appropriate way, we obtain a polynomial-time search algorithm. We investigate different reordering constraints for phrase-based statistical machine tran...

2016
Geoffrey Chu Graeme Gange Peter J. Stuckey

One of the critical issues that affect the efficiency of branch and bound algorithms in Constraint Programming is how strong a bound on the objective function can be inferred at each search node. The stronger the bound that can be inferred, the earlier failed subtrees can be detected, leading to an exponentially smaller search tree. Normal CP solvers are only capable of inferring a bound on the...

Journal: :Vision Research 2009
Keith Langley Veronique Lefebvre Stephen J. Anderson

Following adaptation to an oriented (1-d) signal in central vision, the orientation of subsequently viewed test signals may appear repelled away from or attracted towards the adapting orientation. Small angular differences between the adaptor and test yield 'repulsive' shifts, while large angular differences yield 'attractive' shifts. In peripheral vision, however, both small and large angular ...

2011
Lili Yang Qiaoxue Dong Daoliang Li

Based on the functional-structural plant model GreenLab, a common plant category tomato was selected as a test case in order to analyze the impact of plant density on the yield. A yield optimization model was set up based on minimum ripe fruit weight constraints, fruit weight serve as the objective function for the bound-constrained optimization problem. Particle Swarm Optimization (PSO) algori...

2006
Christophe Giacomotto Nikola Nedovic Vojin G. Oklobdzija

In this paper we present the effect of process variations on the design of clocked storage elements. This work proposes to use the Energy-Delay space analysis for a true representation of the design trade-offs. Consequently, this work also shows a comparison of clocked storage elements under a specific set of system constraints for typical corner design and high yield corner design. Finally, we...

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

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