2108 search results - page 141 / 422 » Constrained Heuristic Search |
108
click to vote
EVOW
2007
Springer
15 years 8 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
131
Voted
JCO
1998
15 years 1 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
98
Voted
GLVLSI
1998
IEEE
15 years 6 months ago
1998
IEEE
In this paper we address the problem of optimizing mixed CMOS BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an ta...
108
click to vote
ICTAI
1996
IEEE
15 years 6 months ago
1996
IEEE
In many applications, such as decision support, negotiation, planning, scheduling, etc., one needs to express requirements that can only be partially satisfied. In order to expres...
133
click to vote
AISB
1995
Springer
15 years 5 months ago
1995
Springer
This paper describes a form of dynamical computational system--4he ant colony---and presents an ant colony model for continuous space optimisation problems. The ant colony metapho...