216 search results - page 24 / 44 » A hybrid exact algorithm for complete set partitioning |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
ATVA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds t...
EVOW
2004
Springer
14 years 27 days ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...