Results 1 - 10
of
1,026
Penalties.....................................
, 2004
"... Output controls.......................................................................................................................... 5 Competitive quotas................................................................................................................ 5 Allocated quotas........... ..."
Abstract
- Add to MetaCart
................................................................................................................... 14 Area and time restrictions.................................................................................................... 18 Minimum size restrictions..................................................................................................... 19
On the Use of Non-Stationary Penalty Functions to Solve Nonlinear Constrained Optimization Problems with GA's
- In
, 1994
"... In this paper we discuss the use of non-stationary penalty functions to solve general nonlinear programming problems (NP ) using real-valued GAs. The non-stationary penalty is a function of the generation number; as the number of generations increases so does the penalty. Therefore, as the penalty i ..."
Abstract
-
Cited by 139 (7 self)
- Add to MetaCart
increases it puts more and more selective pressure on the GA to find a feasible solution. The ideas presented in this paper come from two basic areas: calculus-based nonlinear programming and simulated annealing. The non-stationary penalty methods are tested on four NP test cases and the effectiveness
Theoretical and Numerical Constraint-Handling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art
, 2002
"... This paper provides a comprehensive survey of the most popular constraint-handling techniques currently used with evolutionary algorithms. We review approaches that go from simple variations of a penalty function, to others, more sophisticated, that are biologically inspired on emulations of the imm ..."
Abstract
-
Cited by 187 (26 self)
- Add to MetaCart
This paper provides a comprehensive survey of the most popular constraint-handling techniques currently used with evolutionary algorithms. We review approaches that go from simple variations of a penalty function, to others, more sophisticated, that are biologically inspired on emulations
Normative Power Europe: A Contradiction in Terms
- Journal of Common Market Studies
, 2002
"... Twenty years ago, in the pages of the Journal of Common Market Studies, Hedley Bull launched a searing critique of the European Community’s ‘civilian power ’ in international affairs. Since that time the increasing role of the European Union (EU) in areas of security and defence policy has led to a ..."
Abstract
-
Cited by 179 (2 self)
- Add to MetaCart
Twenty years ago, in the pages of the Journal of Common Market Studies, Hedley Bull launched a searing critique of the European Community’s ‘civilian power ’ in international affairs. Since that time the increasing role of the European Union (EU) in areas of security and defence policy has led to a
Sparse logistic regression with lp penalty for biomarker identification
- Statistical Applications in Genetics and Molecular Biology
"... In this paper, we propose a novel method for sparse logistic regression with non-convex reg-ularization Lp (p <1). Based on smooth approximation, we develop several fast algorithms for learning the classifier that is applicable to high dimensional dataset such as gene expression. To the best of o ..."
Abstract
-
Cited by 20 (3 self)
- Add to MetaCart
of our knowledge, these are the first algorithms to perform sparse logistic regression with an Lp and elastic net (Le) penalty. The regularization parameters are decided through maximizing the area under the ROC curve (AUC) of the test data. Experimental results on methylation and microarray data attest
Penalty Scoring Functions for TCP-nets and Its Applicability in Related Areas
"... Abstract. This paper studies the problem of preference reasoning with Trade-offs Enhanced Conditional Preference Networks (TCP-nets). The features of TCP-nets enable us to easily encode human preferences and the relative importance between the decision variables; however, many real world scenarios o ..."
Abstract
- Add to MetaCart
penalty scoring func-tions. We further discuss the applicability of the proposed transformation in re-lated areas, including preference reasoning, collective decision-making and auto-mated negotiation.
Anxiety, attentional control and performance impairment in penalty kicks
- Journal of Sport and Exercise Psychology
, 2009
"... The current study sought to test the predictions of attentional control theory (ACT) in a sporting environment. Fourteen experienced footballers took penalty kicks under low- and high-threat counterbalanced conditions while wearing a gaze registration system. Fixations to target locations (goalkeepe ..."
Abstract
-
Cited by 10 (2 self)
- Add to MetaCart
The current study sought to test the predictions of attentional control theory (ACT) in a sporting environment. Fourteen experienced footballers took penalty kicks under low- and high-threat counterbalanced conditions while wearing a gaze registration system. Fixations to target locations
Towards consistent penalty decisions for breaches of academic regulations
- in one UK university. International Journal for Educational Integrity, 1(1). (Retrieved 28 /5/2008) http://www.ojs.unisa.edu.au/index.php/IJEI/article/viewFile/15/5
, 2005
"... This paper investigates the extent to which policies and procedures designed to achieve fair, consistent treatment of student plagiarism are effective in one UK university. The case study uses a model more frequently linked to reliability in assessment decisions to inspect penalty decisions and cons ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
for choosing appropriate penalties and evaluate its potential for future monitoring of decisions. Areas for continued attention are identified in the case study, because fully consistent treatment cannot yet be demonstrated.
Tracking with Graph Cuts: Treating Clutter with Adaptive Penalties
"... Many techniques for tracking based on gradient descent cannot follow objects as they undergo large movements or deformation. On the other hand, multi-hypothesis trackers capable of handling such behavior are computationally expensive. The standard graph cut technique offers a middle ground, quickly ..."
Abstract
- Add to MetaCart
realtime. For each object, we introduce a penalty based upon distance from a region of interest. This results in a segmentation biased to this area. Also, we demonstrate the use of a track point filter for predicting the location of the object in each frame. The distance penalty is then centered
Results 1 - 10
of
1,026