Sciweavers

3082 search results - page 372 / 617
» New Bounds for the Controller Problem
Sort
View
MFCS
2004
Springer
16 years 12 hour ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
15 years 11 months ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...
CVPR
2000
IEEE
15 years 11 months ago
Provably Fast Algorithms for Contour Tracking
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...
Daniel Freedman, Michael S. Brandstein
CSR
2006
Springer
15 years 10 months ago
Incremental Branching Programs
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
Anna Gál, Michal Koucký, Pierre McKe...
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 10 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld