Sciweavers

14158 search results - page 25 / 2832
» Generalized switch-setting problems
Sort
View
TAMC
2007
Springer
14 years 4 months ago
The Undecidability of the Generalized Collatz Problem
The Collatz problem, widely known as the 3x + 1 problem, asks whether or not a certain simple iterative process halts on all inputs. We build on earlier work by J. H. Conway, and ...
Stuart A. Kurtz, Janos Simon
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
14 years 3 months 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
NIPS
2001
13 years 11 months ago
Generalization Performance of Some Learning Problems in Hilbert Functional Spaces
We investigate the generalization performance of some learning problems in Hilbert functional Spaces. We introduce a notion of convergence of the estimated functional predictor to...
T. Zhang
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
14 years 3 months ago
Generalized benchmark generation for dynamic combinatorial problems
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
Abdulnasser Younes, Paul H. Calamai, Otman A. Basi...
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
13 years 11 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova