نتایج جستجو برای: penalty

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

2013
Asadallah Najafi

Submitted: May 19, 2013; Accepted: Jun 29, 2013; Published: Aug 07, 2013 Abstract: It is commonly recognized that knowledge is the only source of core competence in the knowledge-based companies, but productivity rate of knowledge worker is always Low. This study seeks to identify factors influence on the productivity. In addition, it presents knowledge workers clusters and measuring productivi...

2009
Andrew T. Barker Susanne C. Brenner Eun-Hee Park Li-Yeng Sung

A WEAKLY OVER-PENALIZED SYMMETRIC INTERIOR PENALTY METHOD SUSANNE C. BRENNER , LUKE OWENS , AND LI-YENG SUNG Abstract. We introduce a new symmetric interior penalty method for symmetric positive definite second order elliptic boundary value problems, where the jumps across element boundaries are weakly over-penalized. Error estimates are derived in the energy norm and the norm for both conformi...

Journal: :California Law Review 1964

Journal: :Women in Higher Education 2020

Journal: :American Sociological Review 2016

2007
Burton A. Weisbrod

The central issue examined in this paper is this: ,Under what circumstances ought governmentally-imposed standards be favored over other policy instruments? The main points made in this paper are as follows. First, the controversy over whether taxes are preferable to quantitative controls was resolved by demonstrating the formal equivalence of taxes and standards. It is always possible to trans...

1996

This paper describes penalty search based on a modified neighborhood search where move and solution penalty functions attempt to keep the search process out of recently "explored" regions. During the penalty search process trajectories which may cause a cycle or drive the search process towards recently found local optimums are made "less attractive" by using penalty parameters. Penalty search ...

2009
Saad Mneimneh

If we believe that the two sequences x and y are similar then we might be able to optimally align them faster. For simplicity assume that m = n since our sequences are similar. If x and y align perfectly, then the optimal alignment corresponds to the diagonal in the dynamic programming table (now of size n × n). This is because all of the back pointers will be pointing diagonally. Therefore, if...

2005
C. Grossmann

Perturbations of Karush-Kuhn-Tucker conditions play an important role for primal-dual interior point methods. Beside the usual logarithmic barrier various further techniques of sequential unconstrained minimization are well known. However other than logarithmic embeddings are rarely studied in connection with Newton path-following methods. A key property that allows to extend the class of metho...

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

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