3142 search results - page 65 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
AI
2006
Springer
14 years 12 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
121
click to vote
AAAI
2010
14 years 8 months ago
2010
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...
79
Voted
AAAI
2010
15 years 1 months ago
2010
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first...
CP
2008
Springer
15 years 1 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
DATE
2002
IEEE
15 years 4 months ago
2002
IEEE
Abstract—Antenna problem is a phenomenon of plasma-induced gateoxide degradation. It directly affects manufacturability of very large scale integration (VLSI) circuits, especiall...