Sciweavers

2180 search results - page 24 / 436
» Comparing bio-inspired algorithms in constrained optimizatio...
Sort
View
CG
2011
Springer
14 years 6 months ago
A projected back-tracking line-search for constrained interactive inverse kinematics
Inverse kinematics is the problem of manipulating the pose of an articulated figure in order to achieve a desired goal disregarding inertia and forces. One can approach the probl...
Morten Engell-Nørregård, Kenny Erlebe...
145
Voted
SIAMJO
2010
125views more  SIAMJO 2010»
14 years 10 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang
CP
2011
Springer
14 years 3 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi
PRICAI
1998
Springer
15 years 7 months ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
TNN
1998
132views more  TNN 1998»
15 years 2 months ago
Synthesis of fault-tolerant feedforward neural networks using minimax optimization
—In this paper we examine a technique by which fault tolerance can be embedded into a feedforward network leading to a network tolerant to the loss of a node and its associated w...
Dipti Deodhare, M. Vidyasagar, S. Sathiya Keerthi