Sciweavers

1984 search results - page 116 / 397
» Variable mesh optimization for continuous optimization probl...
Sort
View
155
Voted
AAAI
2011
14 years 2 months ago
A Feasible Nonconvex Relaxation Approach to Feature Selection
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
Cuixia Gao, Naiyan Wang, Qi Yu, Zhihua Zhang
123
Voted
CP
2003
Springer
15 years 7 months ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez
ICML
2006
IEEE
16 years 3 months ago
Deterministic annealing for semi-supervised kernel machines
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
Vikas Sindhwani, S. Sathiya Keerthi, Olivier Chape...
111
Voted
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 2 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
117
Voted
FPL
2005
Springer
100views Hardware» more  FPL 2005»
15 years 8 months ago
Power and Area Optimization for Multiple Restricted Multiplication
This paper presents a design and optimization technique for the Multiple Restricted Multiplication problem [1]. This refers to a situation where a single variable is multiplied by...
Nalin Sidahao, George A. Constantinides, Peter Y. ...