14158 search results - page 357 / 2832 » Generalized switch-setting problems |
175
click to vote
JMLR
2002
15 years 4 months ago
2002
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
164
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
225
click to vote
IWPEC
2010
Springer
15 years 2 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
131
click to vote
AAIM
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
144
click to vote
MFCS
2010
Springer
15 years 3 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...