3142 search results - page 371 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
120
Voted
ICTAI
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
103
click to vote
TCBB
2008
15 years 18 days ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
COR
2006
15 years 22 days ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
106
click to vote
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
118
click to vote
DAC
1994
ACM
15 years 4 months ago
1994
ACM
In this paper, we revisit the classical problem of functional decomposition [1, 2] that arises so often in logic synthesis. One basic problem that has remained largely unaddressed...