406 search results - page 24 / 82 » Pseudorandomness and Combinatorial Constructions |
141
click to vote
COMPSAC
2006
IEEE
16 years 4 days ago
2006
IEEE
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
160
Voted
EOR
2002
15 years 5 months ago
2002
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
165
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
200
click to vote
CPAIOR
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
156
click to vote
MFCS
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...