1332 search results - page 84 / 267 » Combinatorial Algorithms |
COR
2008
13 years 9 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
AI
1998
Springer
13 years 8 months ago
1998
Springer
This paper introduces a niching technique called GAS (S stands for species) which dynamically creates a subpopulation structure (taxonomic chart) using a radius function instead of...
EC
2010
13 years 6 months ago
2010
Estimation of distribution algorithms (EDAs) that use marginal product model factorizations have been widely applied to a broad range of, mainly binary, optimization problems. In ...
PPSN
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...