Sciweavers

77 search results - page 5 / 16
» Neumann problems with time singularities
Sort
View
GECCO
2007
Springer
136views Optimization» more  GECCO 2007»
14 years 1 months ago
Do additional objectives make a problem harder?
In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experime...
Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus...
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
14 years 1 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
MOR
2008
98views more  MOR 2008»
13 years 7 months ago
An Analysis of Monotone Follower Problems for Diffusion Processes
We consider a singular stochastic control problem, which is called the Monotone Follower Stochastic Control Problem and give sufficient conditions for the existence and uniqueness...
Erhan Bayraktar, Masahiko Egami
NIPS
2004
13 years 8 months ago
Two-Dimensional Linear Discriminant Analysis
Linear Discriminant Analysis (LDA) is a well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional d...
Jieping Ye, Ravi Janardan, Qi Li
CORR
2011
Springer
157views Education» more  CORR 2011»
12 years 11 months ago
Large-Scale Convex Minimization with a Low-Rank Constraint
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
Shai Shalev-Shwartz, Alon Gonen, Ohad Shamir