Sciweavers

14165 search results - page 191 / 2833
» The generalized two-server problem
Sort
View
112
Voted
JCT
2008
59views more  JCT 2008»
15 years 4 months ago
Partition identities and the coin exchange problem
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negati...
Alexander E. Holroyd
EOR
2002
68views more  EOR 2002»
15 years 4 months ago
The computational complexity of the criticality problems in a network with interval activity times
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
Stefan Chanas, Pawel Zielinski
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
15 years 9 months ago
On the complexity of hierarchical problem solving
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
IWPEC
2009
Springer
15 years 10 months ago
On the Directed Degree-Preserving Spanning Tree Problem
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
15 years 10 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland