1171 search results - page 159 / 235 » Variable neighborhood search |
ICCAD
2001
IEEE
14 years 6 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
CEC
2009
IEEE
14 years 4 months ago
2009
IEEE
— Genetic algorithms (GAs) have been argued to constitute a flexible search thereby enabling to solve difficult problems which classical optimization methodologies may find ha...
CP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
DOCENG
2006
ACM
14 years 3 months ago
2006
ACM
In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size fo...
ATAL
2005
Springer
14 years 3 months ago
2005
Springer
We describe a Multi-Agent System (MAS) for controlling teams of uninhabited air vehicles (UAVs) in the context of a larger system that has been used to evaluate potential concepts...