Sciweavers

2657 search results - page 152 / 532
» On the complexity of hierarchical problem solving
Sort
View
CP
1999
Springer
15 years 6 months ago
A Framework for Constraint Programming Based Column Generation
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo ...
115
Voted
ICIP
2003
IEEE
16 years 3 months ago
Spread transform watermarking for video sources
Spread Transform (ST) is a quantization watermarking algorithm in which vectors of the wavelet coefficients of a host work are quantized, using one of two dithered quantizers, to ...
John Earl, Nick G. Kingsbury
GECCO
2005
Springer
144views Optimization» more  GECCO 2005»
15 years 7 months ago
Multiobjective hBOA, clustering, and scalability
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominat...
Martin Pelikan, Kumara Sastry, David E. Goldberg
CAD
2002
Springer
15 years 1 months ago
Surface flattening based on energy model
This paper presents a method for three-dimensional surface flattening, which can be efficiently used in threedimensional computer aided garment design. First, facet model is used ...
Charlie C. L. Wang, Shana S.-F. Smith, Matthew Min...
STACS
2005
Springer
15 years 7 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning