3142 search results - page 115 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
114
click to vote
TC
2008
15 years 3 months ago
2008
In this paper, the problem of finding good wordlength combinations for fixed-point digital signal processing flowgraphs is addressed. By formulating and solving an approximate opti...
128
click to vote
CCO
2001
Springer
15 years 7 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
131
click to vote
ICRA
1995
IEEE
15 years 6 months ago
1995
IEEE
The optimal motion generation problem is solved subject to various actuator constraints while the motion is constrained to an arbitrary path. The considered objective function is ...
132
Voted
DIS
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
132
click to vote
IPCO
2007
15 years 4 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...