5214 search results - page 149 / 1043 » The Online Specialization Problem |
166
click to vote
IADIS
2004
15 years 5 months ago
2004
While the digital age is based on computing, computing disciplines remain conservative in their curricula and delivery methods. Computer science and information systems curricula ...
142
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
141
click to vote
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
139
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...
168
click to vote
WEA
2010
Springer
15 years 9 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...