1208 search results - page 30 / 242 » Uniform eventown problems |
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
SAT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
CORR
2002
Springer
14 years 11 months ago
2002
Springer
Abstract. We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...
100
click to vote
PPSN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...