Sciweavers

8671 search results - page 321 / 1735
» A generator for hierarchical problems
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 6 months ago
Dichotomy for tree-structured trigraph list homomorphism problems
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to...
Tomás Feder, Pavol Hell, David G. Schell, J...
171
Voted
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
16 years 6 days ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
16 years 8 days ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
SC
1994
ACM
15 years 10 months ago
Run-time and compile-time support for adaptive irregular problems
In adaptive irregular problems the data arrays are accessed via indirection arrays, and data access patterns change during computation. Implementingsuch problems ondistributed mem...
Shamik D. Sharma, Ravi Ponnusamy, Bongki Moon, Yua...
GECCO
2009
Springer
15 years 10 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom